./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/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_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/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_2991bc8f-8b28-429b-99cc-e821ec452c14/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 c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:04:13,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:04:13,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:04:13,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:04:13,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:04:13,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:04:13,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:04:13,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:04:13,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:04:13,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:04:13,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:04:13,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:04:13,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:04:13,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:04:13,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:04:13,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:04:13,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:04:13,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:04:13,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:04:13,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:04:13,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:04:13,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:04:13,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:04:13,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:04:13,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:04:13,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:04:13,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:04:13,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:04:13,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:04:13,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:04:13,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:04:13,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:04:13,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:04:13,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:04:13,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:04:13,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:04:13,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:04:13,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:04:13,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:04:13,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:04:13,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:04:13,654 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 21:04:13,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:04:13,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:04:13,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:04:13,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:04:13,677 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:04:13,677 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:04:13,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:04:13,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:04:13,678 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:04:13,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:04:13,678 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:04:13,679 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:04:13,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:04:13,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:04:13,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:04:13,679 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 21:04:13,680 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 21:04:13,680 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 21:04:13,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:04:13,680 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 21:04:13,680 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:04:13,680 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:04:13,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:04:13,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:04:13,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:04:13,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:13,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:04:13,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:04:13,682 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:04:13,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:04:13,682 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_2991bc8f-8b28-429b-99cc-e821ec452c14/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_2991bc8f-8b28-429b-99cc-e821ec452c14/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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2022-11-02 21:04:13,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:04:13,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:04:13,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:04:13,994 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:04:13,995 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:04:13,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2n_update_all.i [2022-11-02 21:04:14,071 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/data/05da81f3b/ff8189a1edc44761987555a8607256a1/FLAGd1080f640 [2022-11-02 21:04:14,587 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:04:14,588 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/sv-benchmarks/c/list-simple/dll2n_update_all.i [2022-11-02 21:04:14,605 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/data/05da81f3b/ff8189a1edc44761987555a8607256a1/FLAGd1080f640 [2022-11-02 21:04:14,891 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/data/05da81f3b/ff8189a1edc44761987555a8607256a1 [2022-11-02 21:04:14,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:04:14,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:04:14,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:14,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:04:14,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:04:14,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:14" (1/1) ... [2022-11-02 21:04:14,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75219b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:14, skipping insertion in model container [2022-11-02 21:04:14,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:14" (1/1) ... [2022-11-02 21:04:14,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:04:14,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:04:15,300 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_2991bc8f-8b28-429b-99cc-e821ec452c14/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2022-11-02 21:04:15,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:15,325 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:04:15,396 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_2991bc8f-8b28-429b-99cc-e821ec452c14/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2022-11-02 21:04:15,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:15,436 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:04:15,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:15 WrapperNode [2022-11-02 21:04:15,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:15,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:15,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:04:15,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:04:15,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:15" (1/1) ... [2022-11-02 21:04:15,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:15" (1/1) ... [2022-11-02 21:04:15,476 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2022-11-02 21:04:15,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:15,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:04:15,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:04:15,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:04:15,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:15" (1/1) ... [2022-11-02 21:04:15,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:15" (1/1) ... [2022-11-02 21:04:15,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:15" (1/1) ... [2022-11-02 21:04:15,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:15" (1/1) ... [2022-11-02 21:04:15,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:15" (1/1) ... [2022-11-02 21:04:15,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:15" (1/1) ... [2022-11-02 21:04:15,503 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:15" (1/1) ... [2022-11-02 21:04:15,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:15" (1/1) ... [2022-11-02 21:04:15,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:04:15,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:04:15,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:04:15,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:04:15,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:15" (1/1) ... [2022-11-02 21:04:15,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:15,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:15,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:04:15,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:04:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-02 21:04:15,582 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-02 21:04:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:04:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:04:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:04:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:04:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:04:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:04:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:04:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:04:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:04:15,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:04:15,695 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:04:15,697 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:04:15,765 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-02 21:04:16,120 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:04:16,130 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:04:16,130 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 21:04:16,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:04:16 BoogieIcfgContainer [2022-11-02 21:04:16,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:04:16,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:04:16,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:04:16,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:04:16,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:04:14" (1/3) ... [2022-11-02 21:04:16,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511b70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:04:16, skipping insertion in model container [2022-11-02 21:04:16,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:15" (2/3) ... [2022-11-02 21:04:16,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511b70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:04:16, skipping insertion in model container [2022-11-02 21:04:16,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:04:16" (3/3) ... [2022-11-02 21:04:16,142 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2022-11-02 21:04:16,161 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:04:16,162 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-11-02 21:04:16,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:04:16,234 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;@3b85cfff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:04:16,234 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-11-02 21:04:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:16,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 21:04:16,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:16,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 21:04:16,257 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:16,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-11-02 21:04:16,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:16,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114332484] [2022-11-02 21:04:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:16,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:16,534 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 21:04:16,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:16,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114332484] [2022-11-02 21:04:16,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114332484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:16,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:16,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:04:16,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566276520] [2022-11-02 21:04:16,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:16,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:16,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:16,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:16,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:16,588 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:16,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:16,773 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-11-02 21:04:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:16,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 21:04:16,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:16,786 INFO L225 Difference]: With dead ends: 111 [2022-11-02 21:04:16,786 INFO L226 Difference]: Without dead ends: 104 [2022-11-02 21:04:16,789 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 21:04:16,793 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:16,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:16,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-02 21:04:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-11-02 21:04:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-11-02 21:04:16,830 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2022-11-02 21:04:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:16,830 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-11-02 21:04:16,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-11-02 21:04:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 21:04:16,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:16,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 21:04:16,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:04:16,832 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:16,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:16,832 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-11-02 21:04:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:16,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210277603] [2022-11-02 21:04:16,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:16,927 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 21:04:16,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:16,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210277603] [2022-11-02 21:04:16,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210277603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:16,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:16,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:04:16,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184488028] [2022-11-02 21:04:16,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:16,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:16,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:16,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:16,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:16,932 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:17,002 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-11-02 21:04:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:17,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 21:04:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:17,006 INFO L225 Difference]: With dead ends: 101 [2022-11-02 21:04:17,007 INFO L226 Difference]: Without dead ends: 101 [2022-11-02 21:04:17,007 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 21:04:17,009 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:17,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-02 21:04:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2022-11-02 21:04:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-11-02 21:04:17,016 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2022-11-02 21:04:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:17,016 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-11-02 21:04:17,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-11-02 21:04:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 21:04:17,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:17,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:17,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:04:17,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:17,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:17,019 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2022-11-02 21:04:17,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:17,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282925618] [2022-11-02 21:04:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:17,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:17,083 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 21:04:17,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:17,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282925618] [2022-11-02 21:04:17,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282925618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:17,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:17,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:17,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733879064] [2022-11-02 21:04:17,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:17,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:17,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:17,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:17,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:17,087 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:17,097 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-11-02 21:04:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:17,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-02 21:04:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:17,098 INFO L225 Difference]: With dead ends: 66 [2022-11-02 21:04:17,098 INFO L226 Difference]: Without dead ends: 66 [2022-11-02 21:04:17,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:17,100 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:17,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-02 21:04:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2022-11-02 21:04:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-11-02 21:04:17,107 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2022-11-02 21:04:17,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:17,107 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-11-02 21:04:17,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-11-02 21:04:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:04:17,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:17,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:17,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:04:17,109 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:17,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:17,110 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-11-02 21:04:17,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:17,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046534618] [2022-11-02 21:04:17,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:17,222 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 21:04:17,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:17,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046534618] [2022-11-02 21:04:17,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046534618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:17,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:17,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:17,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418174039] [2022-11-02 21:04:17,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:17,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:17,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:17,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:17,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:17,225 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:17,257 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-11-02 21:04:17,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:17,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 21:04:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:17,259 INFO L225 Difference]: With dead ends: 63 [2022-11-02 21:04:17,259 INFO L226 Difference]: Without dead ends: 63 [2022-11-02 21:04:17,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:17,261 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:17,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-02 21:04:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-11-02 21:04:17,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-11-02 21:04:17,266 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2022-11-02 21:04:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:17,267 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-11-02 21:04:17,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-11-02 21:04:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:04:17,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:17,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:17,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:04:17,269 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:17,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:17,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2022-11-02 21:04:17,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:17,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618182703] [2022-11-02 21:04:17,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:17,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:17,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:17,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618182703] [2022-11-02 21:04:17,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618182703] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:17,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079137748] [2022-11-02 21:04:17,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:17,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:17,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:17,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:17,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:04:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:17,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 21:04:17,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:17,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:17,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079137748] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:17,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:17,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-02 21:04:17,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503165796] [2022-11-02 21:04:17,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:17,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:04:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:17,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:04:17,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:17,698 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:17,724 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-11-02 21:04:17,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:17,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 21:04:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:17,731 INFO L225 Difference]: With dead ends: 64 [2022-11-02 21:04:17,731 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 21:04:17,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:17,733 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:17,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 21:04:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-02 21:04:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-02 21:04:17,738 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2022-11-02 21:04:17,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:17,739 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-02 21:04:17,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-02 21:04:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 21:04:17,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:17,740 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:17,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:17,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:17,941 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:17,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:17,942 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-11-02 21:04:17,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:17,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687518208] [2022-11-02 21:04:17,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:17,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:18,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:18,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687518208] [2022-11-02 21:04:18,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687518208] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:18,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660363659] [2022-11-02 21:04:18,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:18,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:18,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:18,189 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:18,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:04:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:18,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 21:04:18,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:18,332 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 21:04:18,418 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 21:04:18,419 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 21:04:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:18,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:18,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660363659] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:18,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:18,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-02 21:04:18,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456032702] [2022-11-02 21:04:18,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:18,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:04:18,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:18,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:04:18,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:18,621 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:18,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:18,693 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-11-02 21:04:18,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:18,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 21:04:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:18,694 INFO L225 Difference]: With dead ends: 77 [2022-11-02 21:04:18,695 INFO L226 Difference]: Without dead ends: 77 [2022-11-02 21:04:18,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:04:18,696 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 266 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:18,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 66 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2022-11-02 21:04:18,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-02 21:04:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-11-02 21:04:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-11-02 21:04:18,702 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2022-11-02 21:04:18,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:18,703 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-11-02 21:04:18,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-11-02 21:04:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 21:04:18,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:18,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:18,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-02 21:04:18,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:18,926 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:18,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:18,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-11-02 21:04:18,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:18,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467161285] [2022-11-02 21:04:18,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:19,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:19,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467161285] [2022-11-02 21:04:19,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467161285] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:19,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23725645] [2022-11-02 21:04:19,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:19,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:19,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:19,141 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:19,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:04:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:19,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 21:04:19,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:19,294 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 21:04:19,302 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 21:04:19,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:19,411 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 21:04:19,424 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:04:19,425 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 21:04:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:19,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:19,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23725645] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:19,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:19,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-11-02 21:04:19,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116595975] [2022-11-02 21:04:19,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:19,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:04:19,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:19,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:04:19,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:04:19,799 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:19,911 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-11-02 21:04:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:04:19,914 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 21:04:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:19,916 INFO L225 Difference]: With dead ends: 76 [2022-11-02 21:04:19,917 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 21:04:19,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:04:19,921 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 294 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:19,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 67 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-11-02 21:04:19,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 21:04:19,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-11-02 21:04:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-11-02 21:04:19,937 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2022-11-02 21:04:19,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:19,937 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-11-02 21:04:19,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-11-02 21:04:19,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 21:04:19,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:19,938 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:19,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:20,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-02 21:04:20,154 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:20,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2022-11-02 21:04:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:20,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508564208] [2022-11-02 21:04:20,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:20,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:20,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:20,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508564208] [2022-11-02 21:04:20,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508564208] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:20,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637409390] [2022-11-02 21:04:20,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:04:20,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:20,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:20,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:20,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:04:20,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-02 21:04:20,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:04:20,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 21:04:20,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:04:20,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:04:20,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637409390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:20,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:04:20,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-02 21:04:20,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410153423] [2022-11-02 21:04:20,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:20,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:20,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:20,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:20,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:04:20,350 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:20,392 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2022-11-02 21:04:20,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:04:20,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 21:04:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:20,394 INFO L225 Difference]: With dead ends: 160 [2022-11-02 21:04:20,394 INFO L226 Difference]: Without dead ends: 160 [2022-11-02 21:04:20,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:20,395 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 113 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:20,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 212 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-02 21:04:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 64. [2022-11-02 21:04:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-11-02 21:04:20,435 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 22 [2022-11-02 21:04:20,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:20,436 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-11-02 21:04:20,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-11-02 21:04:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 21:04:20,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:20,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:20,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:20,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:20,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:20,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:20,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969322, now seen corresponding path program 1 times [2022-11-02 21:04:20,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:20,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305610024] [2022-11-02 21:04:20,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:20,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:20,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:20,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305610024] [2022-11-02 21:04:20,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305610024] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:20,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388652117] [2022-11-02 21:04:20,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:20,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:20,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:20,704 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:20,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:04:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:20,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 21:04:20,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:20,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:20,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388652117] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:20,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:20,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-11-02 21:04:20,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981417102] [2022-11-02 21:04:20,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:20,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:20,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:20,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:20,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:20,867 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:20,896 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-11-02 21:04:20,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:20,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 21:04:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:20,897 INFO L225 Difference]: With dead ends: 64 [2022-11-02 21:04:20,897 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 21:04:20,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:20,898 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:20,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 21:04:20,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-02 21:04:20,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-02 21:04:20,902 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 22 [2022-11-02 21:04:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:20,902 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-02 21:04:20,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:20,903 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-02 21:04:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 21:04:20,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:20,903 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:20,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:21,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:21,129 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:21,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:21,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022437, now seen corresponding path program 1 times [2022-11-02 21:04:21,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:21,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734165045] [2022-11-02 21:04:21,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:21,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:21,269 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 21:04:21,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:21,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734165045] [2022-11-02 21:04:21,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734165045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:21,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:21,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:04:21,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440763671] [2022-11-02 21:04:21,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:21,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:04:21,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:21,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:04:21,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:21,272 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:21,462 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-11-02 21:04:21,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:04:21,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 21:04:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:21,464 INFO L225 Difference]: With dead ends: 114 [2022-11-02 21:04:21,464 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 21:04:21,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:04:21,465 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 259 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:21,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:21,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 21:04:21,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 67. [2022-11-02 21:04:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 66 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2022-11-02 21:04:21,475 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 23 [2022-11-02 21:04:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:21,477 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2022-11-02 21:04:21,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2022-11-02 21:04:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 21:04:21,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:21,481 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:21,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:04:21,481 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:21,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022436, now seen corresponding path program 1 times [2022-11-02 21:04:21,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:21,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143149443] [2022-11-02 21:04:21,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:21,793 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 21:04:21,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:21,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143149443] [2022-11-02 21:04:21,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143149443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:21,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:21,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:04:21,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74842887] [2022-11-02 21:04:21,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:21,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:04:21,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:21,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:04:21,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:21,796 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:21,982 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-02 21:04:21,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:04:21,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 21:04:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:21,983 INFO L225 Difference]: With dead ends: 102 [2022-11-02 21:04:21,983 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 21:04:21,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:04:21,984 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:21,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 21:04:21,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 67. [2022-11-02 21:04:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-11-02 21:04:21,987 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 23 [2022-11-02 21:04:21,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:21,987 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-11-02 21:04:21,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-11-02 21:04:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 21:04:21,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:21,988 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:21,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:04:21,989 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:21,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:21,989 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2022-11-02 21:04:21,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:21,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626181714] [2022-11-02 21:04:21,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:21,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:22,125 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 21:04:22,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:22,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626181714] [2022-11-02 21:04:22,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626181714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:22,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:22,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:04:22,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924919782] [2022-11-02 21:04:22,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:22,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:04:22,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:22,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:04:22,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:22,128 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:22,319 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-11-02 21:04:22,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:04:22,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 21:04:22,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:22,320 INFO L225 Difference]: With dead ends: 102 [2022-11-02 21:04:22,320 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 21:04:22,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:04:22,322 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 243 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:22,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 106 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:22,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 21:04:22,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2022-11-02 21:04:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-11-02 21:04:22,326 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 25 [2022-11-02 21:04:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:22,326 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-11-02 21:04:22,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-11-02 21:04:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 21:04:22,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:22,329 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:22,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:04:22,330 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:22,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash -244809886, now seen corresponding path program 1 times [2022-11-02 21:04:22,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:22,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203016158] [2022-11-02 21:04:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:22,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:22,476 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 21:04:22,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:22,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203016158] [2022-11-02 21:04:22,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203016158] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:22,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628494843] [2022-11-02 21:04:22,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:22,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:22,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:22,482 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:22,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 21:04:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:22,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 21:04:22,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:04:22,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:04:22,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628494843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:22,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:04:22,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-02 21:04:22,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449425728] [2022-11-02 21:04:22,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:22,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:22,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:22,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:22,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:04:22,663 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:22,685 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-11-02 21:04:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:22,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 21:04:22,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:22,687 INFO L225 Difference]: With dead ends: 91 [2022-11-02 21:04:22,687 INFO L226 Difference]: Without dead ends: 91 [2022-11-02 21:04:22,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:04:22,688 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 85 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:22,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 105 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-02 21:04:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2022-11-02 21:04:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-11-02 21:04:22,695 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 25 [2022-11-02 21:04:22,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:22,697 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-11-02 21:04:22,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-11-02 21:04:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 21:04:22,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:22,699 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:22,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:22,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 21:04:22,934 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:22,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:22,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1962551634, now seen corresponding path program 1 times [2022-11-02 21:04:22,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:22,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067209214] [2022-11-02 21:04:22,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:22,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:04:23,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:23,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067209214] [2022-11-02 21:04:23,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067209214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:23,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:23,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:04:23,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584858075] [2022-11-02 21:04:23,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:23,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:04:23,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:23,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:04:23,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:23,228 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:23,393 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-11-02 21:04:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:04:23,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 21:04:23,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:23,395 INFO L225 Difference]: With dead ends: 94 [2022-11-02 21:04:23,395 INFO L226 Difference]: Without dead ends: 94 [2022-11-02 21:04:23,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:04:23,396 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 324 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:23,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 75 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-02 21:04:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2022-11-02 21:04:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-11-02 21:04:23,399 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 30 [2022-11-02 21:04:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:23,399 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-11-02 21:04:23,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-11-02 21:04:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 21:04:23,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:23,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:23,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:04:23,400 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:23,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:23,401 INFO L85 PathProgramCache]: Analyzing trace with hash -669697558, now seen corresponding path program 1 times [2022-11-02 21:04:23,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:23,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394950548] [2022-11-02 21:04:23,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:23,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:04:23,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:23,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394950548] [2022-11-02 21:04:23,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394950548] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:23,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800992873] [2022-11-02 21:04:23,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:23,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:23,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:23,506 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:23,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 21:04:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:23,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 21:04:23,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:04:23,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:04:23,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800992873] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:23,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:23,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-11-02 21:04:23,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279107336] [2022-11-02 21:04:23,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:23,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:04:23,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:23,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:04:23,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:23,730 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:23,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:23,803 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2022-11-02 21:04:23,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:04:23,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 21:04:23,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:23,805 INFO L225 Difference]: With dead ends: 136 [2022-11-02 21:04:23,805 INFO L226 Difference]: Without dead ends: 136 [2022-11-02 21:04:23,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:04:23,808 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 152 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:23,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 232 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:23,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-02 21:04:23,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 79. [2022-11-02 21:04:23,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.375) internal successors, (88), 78 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2022-11-02 21:04:23,812 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 31 [2022-11-02 21:04:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:23,812 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2022-11-02 21:04:23,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:23,813 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-11-02 21:04:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 21:04:23,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:23,816 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:23,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:24,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:24,034 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash -669697613, now seen corresponding path program 1 times [2022-11-02 21:04:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:24,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308396724] [2022-11-02 21:04:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:24,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:04:24,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:24,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308396724] [2022-11-02 21:04:24,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308396724] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:24,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428211772] [2022-11-02 21:04:24,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:24,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:24,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:24,848 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:24,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 21:04:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:25,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-02 21:04:25,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:25,025 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 21:04:25,059 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:04:25,060 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 21:04:25,084 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 21:04:25,115 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 23 treesize of output 22 [2022-11-02 21:04:25,143 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:04:25,143 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 34 treesize of output 35 [2022-11-02 21:04:25,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:25,343 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 26 [2022-11-02 21:04:25,403 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 31 treesize of output 13 [2022-11-02 21:04:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:04:25,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:32,637 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-02 21:04:32,638 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 21 treesize of output 20 [2022-11-02 21:04:32,645 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2022-11-02 21:04:32,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_884 Int) (v_ArrVal_886 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_884)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2022-11-02 21:04:32,672 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:32,672 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 2 case distinctions, treesize of input 27 treesize of output 33 [2022-11-02 21:04:32,678 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 36 treesize of output 24 [2022-11-02 21:04:32,684 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 21:04:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-02 21:04:32,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428211772] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:32,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:32,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 32 [2022-11-02 21:04:32,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159652530] [2022-11-02 21:04:32,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:32,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 21:04:32,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:32,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 21:04:32,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=844, Unknown=3, NotChecked=118, Total=1056 [2022-11-02 21:04:32,772 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:34,486 INFO L93 Difference]: Finished difference Result 217 states and 242 transitions. [2022-11-02 21:04:34,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 21:04:34,486 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 21:04:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:34,489 INFO L225 Difference]: With dead ends: 217 [2022-11-02 21:04:34,489 INFO L226 Difference]: Without dead ends: 217 [2022-11-02 21:04:34,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=332, Invalid=1927, Unknown=5, NotChecked=186, Total=2450 [2022-11-02 21:04:34,491 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1050 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 464 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:34,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 734 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 713 Invalid, 0 Unknown, 464 Unchecked, 0.6s Time] [2022-11-02 21:04:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-02 21:04:34,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 109. [2022-11-02 21:04:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 108 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2022-11-02 21:04:34,499 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 31 [2022-11-02 21:04:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:34,500 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2022-11-02 21:04:34,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:34,501 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2022-11-02 21:04:34,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 21:04:34,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:34,501 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:34,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:34,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 21:04:34,726 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:34,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:34,726 INFO L85 PathProgramCache]: Analyzing trace with hash -669697612, now seen corresponding path program 1 times [2022-11-02 21:04:34,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:34,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586450649] [2022-11-02 21:04:34,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:34,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:04:35,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:35,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586450649] [2022-11-02 21:04:35,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586450649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:35,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330605311] [2022-11-02 21:04:35,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:35,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:35,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:35,886 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:35,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 21:04:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:36,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-02 21:04:36,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:36,060 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 21:04:36,160 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:04:36,160 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 21:04:36,212 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 21:04:36,218 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 21:04:36,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 21:04:36,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 23 treesize of output 22 [2022-11-02 21:04:36,342 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:04:36,342 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 54 treesize of output 53 [2022-11-02 21:04:36,352 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 41 treesize of output 41 [2022-11-02 21:04:36,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:36,663 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 33 [2022-11-02 21:04:36,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:36,675 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 41 treesize of output 34 [2022-11-02 21:04:36,779 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 39 treesize of output 21 [2022-11-02 21:04:36,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-11-02 21:04:36,876 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:04:36,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:38,121 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse1)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))))) is different from false [2022-11-02 21:04:40,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse1))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse1)))))))) is different from false [2022-11-02 21:04:42,197 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse1)))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse1))))))) is different from false [2022-11-02 21:04:44,246 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse1)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse1))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))))) is different from false [2022-11-02 21:04:44,274 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:44,275 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 64 treesize of output 68 [2022-11-02 21:04:44,371 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_2 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1006 Int)) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_2 v_ArrVal_1006) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_2))) (forall ((v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int) (v_ArrVal_1005 Int)) (or (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (forall ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_2 v_prenex_3) .cse0) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_2))))) is different from false [2022-11-02 21:04:44,433 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1000 Int) (v_prenex_2 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1006 Int)) (or (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 v_ArrVal_1000)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_2 v_ArrVal_1006) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_2))) (forall ((v_ArrVal_1001 Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int) (v_ArrVal_1005 Int)) (or (<= 0 (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse0 v_ArrVal_1001)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse1)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (forall ((v_prenex_2 Int) (v_prenex_3 Int) (v_ArrVal_1001 Int) (v_prenex_1 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_2) (< (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse0 v_ArrVal_1001)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_2 v_prenex_3) .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9)))))) is different from false [2022-11-02 21:04:44,464 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:44,464 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-11-02 21:04:44,470 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 46 treesize of output 42 [2022-11-02 21:04:44,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:04:44,476 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 13 treesize of output 9 [2022-11-02 21:04:44,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:04:44,481 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 23 treesize of output 15 [2022-11-02 21:04:44,494 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:44,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2022-11-02 21:04:44,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:04:44,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-11-02 21:04:44,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:04:44,505 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 16 treesize of output 8 [2022-11-02 21:04:44,515 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 21:04:44,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 1 [2022-11-02 21:04:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-02 21:04:44,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330605311] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:44,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:44,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 39 [2022-11-02 21:04:44,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862363429] [2022-11-02 21:04:44,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:44,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-02 21:04:44,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:44,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-02 21:04:44,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1035, Unknown=6, NotChecked=414, Total=1560 [2022-11-02 21:04:44,717 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:51,527 WARN L234 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 64 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:04:55,849 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select .cse5 .cse4)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse3 .cse4)) (.cse1 (select |c_#length| .cse2))) (and (<= 0 .cse0) (<= (+ .cse0 12) .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (<= (+ (select (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse4) 4) (select |c_#length| (select (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse4))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (= .cse1 12))))) is different from false [2022-11-02 21:04:56,696 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse3 (select .cse2 .cse1)) (.cse4 (select .cse0 .cse1))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse1) 4) (select |c_#length| (select (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse1)))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse1))))) (<= (+ .cse4 12) (select |c_#length| .cse3)) (= (select |c_#length| (select .cse2 4)) 12) (= (select .cse0 4) 0) (<= 0 .cse4)))) is different from false [2022-11-02 21:04:57,566 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse4 .cse3)) (.cse0 (select .cse2 .cse3))) (and (<= (+ 12 .cse0) (select |c_#length| .cse1)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse3))))) (= (select |c_#length| (select .cse4 4)) 12) (not (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (<= 0 .cse0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (<= (+ (select (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse3) 4) (select |c_#length| (select (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse3)))))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select .cse2 4) 0)))) is different from false [2022-11-02 21:04:58,415 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select .cse3 .cse4)) (.cse1 (select .cse2 .cse4))) (and (<= (+ 12 .cse0) (select |c_#length| .cse1)) (= 12 (select |c_#length| (select .cse2 4))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (<= (+ (select (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse4) 4) (select |c_#length| (select (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (= (select .cse3 4) 0) (<= 0 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1))))) is different from false [2022-11-02 21:04:59,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:59,510 INFO L93 Difference]: Finished difference Result 236 states and 271 transitions. [2022-11-02 21:04:59,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 21:04:59,511 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 21:04:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:59,512 INFO L225 Difference]: With dead ends: 236 [2022-11-02 21:04:59,512 INFO L226 Difference]: Without dead ends: 236 [2022-11-02 21:04:59,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=231, Invalid=1689, Unknown=12, NotChecked=930, Total=2862 [2022-11-02 21:04:59,514 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 540 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 774 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:59,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1346 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 821 Invalid, 0 Unknown, 774 Unchecked, 0.8s Time] [2022-11-02 21:04:59,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-02 21:04:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 147. [2022-11-02 21:04:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 146 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 175 transitions. [2022-11-02 21:04:59,521 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 175 transitions. Word has length 31 [2022-11-02 21:04:59,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:59,521 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 175 transitions. [2022-11-02 21:04:59,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 175 transitions. [2022-11-02 21:04:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 21:04:59,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:59,524 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:59,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:59,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:59,742 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:59,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1015753968, now seen corresponding path program 1 times [2022-11-02 21:04:59,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:59,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894440044] [2022-11-02 21:04:59,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:59,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:04:59,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:59,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894440044] [2022-11-02 21:04:59,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894440044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:59,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:59,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:59,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832708010] [2022-11-02 21:04:59,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:59,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:59,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:59,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:59,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:59,825 INFO L87 Difference]: Start difference. First operand 147 states and 175 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:59,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:59,855 INFO L93 Difference]: Finished difference Result 171 states and 200 transitions. [2022-11-02 21:04:59,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:04:59,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 21:04:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:59,857 INFO L225 Difference]: With dead ends: 171 [2022-11-02 21:04:59,857 INFO L226 Difference]: Without dead ends: 171 [2022-11-02 21:04:59,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:59,858 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:59,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 161 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:59,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-02 21:04:59,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 148. [2022-11-02 21:04:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 133 states have (on average 1.3233082706766917) internal successors, (176), 147 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:59,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 176 transitions. [2022-11-02 21:04:59,866 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 176 transitions. Word has length 33 [2022-11-02 21:04:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:59,866 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 176 transitions. [2022-11-02 21:04:59,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 176 transitions. [2022-11-02 21:04:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 21:04:59,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:59,868 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:59,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:04:59,869 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:04:59,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:59,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1373031599, now seen corresponding path program 1 times [2022-11-02 21:04:59,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:59,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323295675] [2022-11-02 21:04:59,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:59,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:05:00,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:00,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323295675] [2022-11-02 21:05:00,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323295675] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:00,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516876596] [2022-11-02 21:05:00,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:00,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:00,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:00,058 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:00,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 21:05:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:00,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 21:05:00,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:05:00,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:05:00,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516876596] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:00,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:00,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-11-02 21:05:00,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842806623] [2022-11-02 21:05:00,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:00,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:05:00,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:00,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:05:00,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:05:00,393 INFO L87 Difference]: Start difference. First operand 148 states and 176 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:00,463 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2022-11-02 21:05:00,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:00,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 21:05:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:00,464 INFO L225 Difference]: With dead ends: 189 [2022-11-02 21:05:00,465 INFO L226 Difference]: Without dead ends: 189 [2022-11-02 21:05:00,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:05:00,465 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 103 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:00,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 249 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-02 21:05:00,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 154. [2022-11-02 21:05:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 139 states have (on average 1.2949640287769784) internal successors, (180), 153 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2022-11-02 21:05:00,470 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 34 [2022-11-02 21:05:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:00,470 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2022-11-02 21:05:00,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2022-11-02 21:05:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 21:05:00,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:00,471 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:00,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:00,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:00,671 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:00,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash -833185593, now seen corresponding path program 2 times [2022-11-02 21:05:00,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:00,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565865981] [2022-11-02 21:05:00,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:00,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:05:00,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:00,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565865981] [2022-11-02 21:05:00,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565865981] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:00,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909667579] [2022-11-02 21:05:00,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:05:00,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:00,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:00,816 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:00,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 21:05:01,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:05:01,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:05:01,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 21:05:01,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:05:01,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:05:01,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909667579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:01,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:05:01,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-11-02 21:05:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646433702] [2022-11-02 21:05:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:01,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:05:01,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:01,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:05:01,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:01,061 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:01,074 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-11-02 21:05:01,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:05:01,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-02 21:05:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:01,075 INFO L225 Difference]: With dead ends: 104 [2022-11-02 21:05:01,075 INFO L226 Difference]: Without dead ends: 104 [2022-11-02 21:05:01,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:01,077 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 149 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:01,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 73 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:05:01,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-02 21:05:01,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-02 21:05:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.348314606741573) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2022-11-02 21:05:01,086 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 39 [2022-11-02 21:05:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:01,086 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2022-11-02 21:05:01,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:01,087 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2022-11-02 21:05:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 21:05:01,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:01,087 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:01,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:01,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:01,313 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1013618178, now seen corresponding path program 2 times [2022-11-02 21:05:01,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:01,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502596644] [2022-11-02 21:05:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:01,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:01,482 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:05:01,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:01,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502596644] [2022-11-02 21:05:01,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502596644] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:01,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309831284] [2022-11-02 21:05:01,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:05:01,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:01,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:01,485 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:01,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 21:05:01,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:05:01,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:05:01,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 21:05:01,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 21:05:01,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:05:01,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309831284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:01,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:05:01,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2022-11-02 21:05:01,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655195647] [2022-11-02 21:05:01,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:01,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:01,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:01,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:05:01,793 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:01,821 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-11-02 21:05:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:05:01,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-02 21:05:01,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:01,822 INFO L225 Difference]: With dead ends: 82 [2022-11-02 21:05:01,822 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 21:05:01,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:05:01,823 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 65 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:01,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 115 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:05:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 21:05:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2022-11-02 21:05:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-11-02 21:05:01,825 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 39 [2022-11-02 21:05:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:01,826 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-11-02 21:05:01,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-11-02 21:05:01,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 21:05:01,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:01,826 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:01,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:02,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:02,046 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:02,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1273435421, now seen corresponding path program 2 times [2022-11-02 21:05:02,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:02,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685627700] [2022-11-02 21:05:02,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:02,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:05:02,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:02,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685627700] [2022-11-02 21:05:02,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685627700] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:02,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587394870] [2022-11-02 21:05:02,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:05:02,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:02,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:02,206 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:02,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 21:05:02,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:05:02,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:05:02,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 21:05:02,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:05:02,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:05:02,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587394870] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:02,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:02,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-11-02 21:05:02,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865352705] [2022-11-02 21:05:02,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:02,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:05:02,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:02,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:05:02,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:05:02,482 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:02,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:02,625 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-11-02 21:05:02,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:05:02,626 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-02 21:05:02,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:02,626 INFO L225 Difference]: With dead ends: 78 [2022-11-02 21:05:02,626 INFO L226 Difference]: Without dead ends: 78 [2022-11-02 21:05:02,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:05:02,627 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 171 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:02,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 271 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-02 21:05:02,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-11-02 21:05:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-11-02 21:05:02,630 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 39 [2022-11-02 21:05:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:02,630 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-11-02 21:05:02,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-11-02 21:05:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 21:05:02,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:02,630 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:02,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:02,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:02,838 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:02,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:02,838 INFO L85 PathProgramCache]: Analyzing trace with hash 993974679, now seen corresponding path program 1 times [2022-11-02 21:05:02,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:02,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220397828] [2022-11-02 21:05:02,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:02,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:04,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:04,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220397828] [2022-11-02 21:05:04,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220397828] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:04,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19256020] [2022-11-02 21:05:04,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:04,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:04,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:04,158 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:04,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 21:05:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:04,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-02 21:05:04,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:04,413 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 21:05:04,518 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:04,518 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 21:05:04,577 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 21:05:04,637 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 23 treesize of output 22 [2022-11-02 21:05:04,678 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:04,679 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 23 treesize of output 26 [2022-11-02 21:05:04,998 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 20 treesize of output 19 [2022-11-02 21:05:05,004 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 21:05:05,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:05,185 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2022-11-02 21:05:05,319 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 21:05:05,510 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 21:05:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:05,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:05,816 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1680 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1680 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-11-02 21:05:05,841 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1680 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1680 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2022-11-02 21:05:05,852 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_1680 (Array Int Int))) (<= (select (select (store |c_#memory_int| .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1680 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-02 21:05:05,871 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_ArrVal_1680 (Array Int Int))) (<= (select (select (store |c_#memory_int| .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1680 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-02 21:05:05,895 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:05,895 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 32 treesize of output 33 [2022-11-02 21:05:05,909 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:05,910 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 58 treesize of output 61 [2022-11-02 21:05:05,916 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 23 treesize of output 21 [2022-11-02 21:05:05,949 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:05,949 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 32 treesize of output 33 [2022-11-02 21:05:05,960 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-11-02 21:05:05,967 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 23 treesize of output 21 [2022-11-02 21:05:06,258 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1674 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1674) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2022-11-02 21:05:06,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1673 Int) (v_ArrVal_1674 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1673)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1674) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2022-11-02 21:05:06,281 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:06,281 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 2 case distinctions, treesize of input 28 treesize of output 34 [2022-11-02 21:05:06,287 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 39 treesize of output 27 [2022-11-02 21:05:06,294 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 8 treesize of output 4 [2022-11-02 21:05:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-02 21:05:06,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19256020] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:06,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:06,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 58 [2022-11-02 21:05:06,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596821952] [2022-11-02 21:05:06,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:06,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-02 21:05:06,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:06,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-02 21:05:06,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2465, Unknown=6, NotChecked=630, Total=3306 [2022-11-02 21:05:06,446 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:08,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:08,175 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-11-02 21:05:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 21:05:08,176 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-02 21:05:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:08,177 INFO L225 Difference]: With dead ends: 76 [2022-11-02 21:05:08,177 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 21:05:08,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=472, Invalid=4376, Unknown=6, NotChecked=846, Total=5700 [2022-11-02 21:05:08,180 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 109 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 444 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:08,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 956 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 803 Invalid, 0 Unknown, 444 Unchecked, 0.6s Time] [2022-11-02 21:05:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 21:05:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-02 21:05:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2) internal successors, (78), 75 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-11-02 21:05:08,183 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 42 [2022-11-02 21:05:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:08,183 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-11-02 21:05:08,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-11-02 21:05:08,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 21:05:08,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:08,184 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:08,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:08,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:08,406 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:08,406 INFO L85 PathProgramCache]: Analyzing trace with hash 594303695, now seen corresponding path program 1 times [2022-11-02 21:05:08,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:08,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065295306] [2022-11-02 21:05:08,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:08,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:10,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:10,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065295306] [2022-11-02 21:05:10,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065295306] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:10,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256768676] [2022-11-02 21:05:10,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:10,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:10,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:10,294 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:10,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 21:05:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:10,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-02 21:05:10,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:10,516 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 21:05:10,592 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:10,593 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 21:05:10,631 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 21:05:10,674 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 23 treesize of output 22 [2022-11-02 21:05:10,694 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:10,694 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 23 treesize of output 26 [2022-11-02 21:05:10,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:10,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 22 treesize of output 21 [2022-11-02 21:05:11,099 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:11,100 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 34 treesize of output 35 [2022-11-02 21:05:11,269 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 31 treesize of output 13 [2022-11-02 21:05:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:05:11,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:11,412 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-02 21:05:11,412 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 21 treesize of output 20 [2022-11-02 21:05:11,417 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1806 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) is different from false [2022-11-02 21:05:11,426 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1806 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2022-11-02 21:05:11,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1806 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2022-11-02 21:05:11,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1806 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)))) is different from false [2022-11-02 21:05:11,455 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (v_ArrVal_1806 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1805))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) is different from false [2022-11-02 21:05:11,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) is different from false [2022-11-02 21:05:11,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) .cse0 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2022-11-02 21:05:11,499 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) .cse1 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2) .cse1))))) is different from false [2022-11-02 21:05:11,531 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) .cse1 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) .cse1))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2022-11-02 21:05:11,546 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1803))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2022-11-02 21:05:11,569 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1801 Int) (v_ArrVal_1803 (Array Int Int))) (or (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1801)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1803))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select .cse1 .cse3))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) .cse2)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2022-11-02 21:05:11,584 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:11,584 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 71 [2022-11-02 21:05:11,589 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 100 treesize of output 92 [2022-11-02 21:05:11,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:11,596 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 34 treesize of output 22 [2022-11-02 21:05:11,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:11,603 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 20 treesize of output 12 [2022-11-02 21:05:11,607 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 21:05:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 13 not checked. [2022-11-02 21:05:11,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256768676] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:11,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:11,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 19] total 54 [2022-11-02 21:05:11,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047460383] [2022-11-02 21:05:11,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:11,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-02 21:05:11,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:11,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-02 21:05:11,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1785, Unknown=11, NotChecked=1034, Total=2970 [2022-11-02 21:05:11,711 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 55 states, 54 states have (on average 2.4444444444444446) internal successors, (132), 55 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:12,063 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1803))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805))) (let ((.cse1 (select .cse3 .cse0))) (= .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) .cse1 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from false [2022-11-02 21:05:12,068 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1803))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805))) (let ((.cse1 (select .cse3 .cse0))) (= .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) .cse1 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))))) is different from false [2022-11-02 21:05:12,072 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (let ((.cse0 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) .cse1 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) .cse1))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) (not (= (select .cse3 .cse2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from false [2022-11-02 21:05:12,076 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= (select .cse0 .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805))) (let ((.cse3 (select .cse2 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2) .cse3 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) .cse3))))))) is different from false [2022-11-02 21:05:12,080 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (and (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (let ((.cse1 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) .cse0 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) (not (= (select .cse3 .cse2) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2022-11-02 21:05:12,092 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse0 .cse1))) (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805))) (let ((.cse3 (select .cse2 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse3 v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse3))))))) is different from false [2022-11-02 21:05:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:13,677 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-11-02 21:05:13,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 21:05:13,678 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.4444444444444446) internal successors, (132), 55 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-02 21:05:13,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:13,679 INFO L225 Difference]: With dead ends: 118 [2022-11-02 21:05:13,679 INFO L226 Difference]: Without dead ends: 118 [2022-11-02 21:05:13,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=387, Invalid=3204, Unknown=17, NotChecked=2244, Total=5852 [2022-11-02 21:05:13,681 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 950 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 991 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:13,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 744 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 988 Invalid, 0 Unknown, 991 Unchecked, 0.8s Time] [2022-11-02 21:05:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-02 21:05:13,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2022-11-02 21:05:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-11-02 21:05:13,683 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 48 [2022-11-02 21:05:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:13,684 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-11-02 21:05:13,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.4444444444444446) internal successors, (132), 55 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-11-02 21:05:13,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 21:05:13,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:13,684 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:13,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:13,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:13,898 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:13,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash 594303696, now seen corresponding path program 1 times [2022-11-02 21:05:13,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:13,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436372192] [2022-11-02 21:05:13,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:13,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:16,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:16,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436372192] [2022-11-02 21:05:16,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436372192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:16,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952187001] [2022-11-02 21:05:16,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:16,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:16,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:16,998 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:16,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 21:05:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-02 21:05:17,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:17,197 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 21:05:17,276 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:17,276 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 21:05:17,322 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 21:05:17,372 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 23 treesize of output 22 [2022-11-02 21:05:17,392 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:17,392 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 23 treesize of output 26 [2022-11-02 21:05:17,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:17,613 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 22 treesize of output 21 [2022-11-02 21:05:17,862 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:17,863 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 54 treesize of output 53 [2022-11-02 21:05:17,868 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 41 treesize of output 41 [2022-11-02 21:05:18,140 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 39 treesize of output 21 [2022-11-02 21:05:18,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-11-02 21:05:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:05:18,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:18,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:18,493 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 47 treesize of output 51 [2022-11-02 21:05:18,771 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:18,771 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 128 treesize of output 109 [2022-11-02 21:05:18,776 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 93 treesize of output 89 [2022-11-02 21:05:18,781 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 89 treesize of output 85 [2022-11-02 21:05:19,413 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2022-11-02 21:05:19,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)))) is different from false [2022-11-02 21:05:20,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2022-11-02 21:05:20,667 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2022-11-02 21:05:20,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1930 Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1929) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2022-11-02 21:05:20,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1926 Int) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1930 Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1926)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1929) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2022-11-02 21:05:20,729 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:20,730 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-11-02 21:05:20,735 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 45 treesize of output 41 [2022-11-02 21:05:20,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:20,740 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 38 treesize of output 30 [2022-11-02 21:05:20,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:20,749 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 8 treesize of output 4 [2022-11-02 21:05:20,863 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-02 21:05:20,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952187001] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:20,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:20,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 17, 19] total 56 [2022-11-02 21:05:20,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536347672] [2022-11-02 21:05:20,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:20,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-02 21:05:20,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:20,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-02 21:05:20,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2374, Unknown=6, NotChecked=618, Total=3192 [2022-11-02 21:05:20,866 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 57 states, 56 states have (on average 2.357142857142857) internal successors, (132), 57 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:21,942 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse6 (select .cse4 .cse5)) (.cse7 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse3 (<= .cse7 12)) (.cse1 (= .cse7 12)) (.cse0 (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (<= |c_ULTIMATE.start_main_~len~0#1| 2) (or .cse0 (not .cse1)) .cse2 .cse3 (or (and .cse2 .cse3) .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (not (= (select (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) .cse5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) .cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5) 0) (<= 2 |c_ULTIMATE.start_main_~len~0#1|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#length| .cse6) 12) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))) is different from false [2022-11-02 21:05:22,376 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (select .cse0 4))) (and (<= |c_ULTIMATE.start_main_~len~0#1| 2) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (not (= (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) (<= 2 |c_ULTIMATE.start_main_~len~0#1|) (= (select |c_#length| .cse1) 12) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-11-02 21:05:22,913 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (select .cse0 4))) (and (<= |c_ULTIMATE.start_main_~len~0#1| 2) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (not (= (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) (<= 2 |c_ULTIMATE.start_main_~len~0#1|) (= (select |c_#length| .cse1) 12) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-11-02 21:05:23,438 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (<= |c_ULTIMATE.start_main_~len~0#1| 2) (= (select |c_#length| .cse0) 12) (not (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (<= 2 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)))) is different from false [2022-11-02 21:05:23,957 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (<= |c_ULTIMATE.start_main_~len~0#1| 2) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= 12 (select |c_#length| .cse0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 2 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (not (= (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|)))))) is different from false [2022-11-02 21:05:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:26,415 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2022-11-02 21:05:26,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 21:05:26,416 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.357142857142857) internal successors, (132), 57 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-02 21:05:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:26,416 INFO L225 Difference]: With dead ends: 125 [2022-11-02 21:05:26,417 INFO L226 Difference]: Without dead ends: 125 [2022-11-02 21:05:26,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=459, Invalid=3996, Unknown=11, NotChecked=1540, Total=6006 [2022-11-02 21:05:26,419 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 688 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 633 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:26,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 1318 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1223 Invalid, 0 Unknown, 633 Unchecked, 1.1s Time] [2022-11-02 21:05:26,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-02 21:05:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 79. [2022-11-02 21:05:26,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-11-02 21:05:26,422 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 48 [2022-11-02 21:05:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:26,423 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-11-02 21:05:26,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.357142857142857) internal successors, (132), 57 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-11-02 21:05:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 21:05:26,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:26,424 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:26,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:26,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:26,638 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:26,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:26,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1192975024, now seen corresponding path program 1 times [2022-11-02 21:05:26,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:26,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7887965] [2022-11-02 21:05:26,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:26,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 21:05:26,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:26,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7887965] [2022-11-02 21:05:26,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7887965] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:26,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033865129] [2022-11-02 21:05:26,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:26,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:26,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:26,782 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:26,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-02 21:05:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 21:05:27,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 21:05:27,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 21:05:27,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033865129] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:27,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:27,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-02 21:05:27,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574848701] [2022-11-02 21:05:27,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:27,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:27,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:27,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:27,093 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:27,145 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-11-02 21:05:27,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:05:27,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-11-02 21:05:27,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:27,146 INFO L225 Difference]: With dead ends: 79 [2022-11-02 21:05:27,146 INFO L226 Difference]: Without dead ends: 79 [2022-11-02 21:05:27,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:27,147 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 84 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:27,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 160 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:05:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-02 21:05:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-02 21:05:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 78 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-11-02 21:05:27,152 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 49 [2022-11-02 21:05:27,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:27,152 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-11-02 21:05:27,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-11-02 21:05:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 21:05:27,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:27,153 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:27,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:27,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-02 21:05:27,382 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:27,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1047895438, now seen corresponding path program 2 times [2022-11-02 21:05:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:27,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749364377] [2022-11-02 21:05:27,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 21:05:27,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:27,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749364377] [2022-11-02 21:05:27,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749364377] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:27,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734090331] [2022-11-02 21:05:27,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:05:27,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:27,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:27,504 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:27,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-02 21:05:27,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:05:27,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:05:27,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 21:05:27,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 21:05:27,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 21:05:27,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734090331] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:27,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:27,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-11-02 21:05:27,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134776218] [2022-11-02 21:05:27,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:27,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:05:27,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:27,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:05:27,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:27,913 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:27,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:27,979 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-11-02 21:05:27,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:05:27,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-02 21:05:27,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:27,980 INFO L225 Difference]: With dead ends: 70 [2022-11-02 21:05:27,980 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 21:05:27,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:05:27,981 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 78 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:27,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 127 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:05:27,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 21:05:27,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-02 21:05:27,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 69 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2022-11-02 21:05:27,984 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 51 [2022-11-02 21:05:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:27,984 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2022-11-02 21:05:27,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:27,985 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-11-02 21:05:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 21:05:27,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:27,985 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:28,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-02 21:05:28,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-02 21:05:28,202 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:28,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:28,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1925550127, now seen corresponding path program 1 times [2022-11-02 21:05:28,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:28,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18618436] [2022-11-02 21:05:28,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:28,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:29,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:29,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18618436] [2022-11-02 21:05:29,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18618436] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:29,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709159972] [2022-11-02 21:05:29,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:29,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:29,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:29,966 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:29,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-02 21:05:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:30,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-02 21:05:30,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:30,207 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 21:05:30,254 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:30,255 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 21:05:30,295 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 21:05:30,354 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 23 treesize of output 22 [2022-11-02 21:05:30,376 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:30,376 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 23 treesize of output 26 [2022-11-02 21:05:30,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:30,627 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 22 treesize of output 21 [2022-11-02 21:05:30,930 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:30,930 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 66 treesize of output 63 [2022-11-02 21:05:30,942 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 31 treesize of output 21 [2022-11-02 21:05:30,947 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 34 treesize of output 36 [2022-11-02 21:05:31,308 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 39 treesize of output 21 [2022-11-02 21:05: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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-02 21:05:31,359 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 21:05:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:31,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:31,871 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 86 treesize of output 64 [2022-11-02 21:05:31,890 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 86 treesize of output 64 [2022-11-02 21:05:31,909 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2292 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2292) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (<= |c_ULTIMATE.start_dll_update_at_~data#1| .cse1) (<= .cse1 |c_ULTIMATE.start_dll_update_at_~data#1|) (forall ((v_ArrVal_2290 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2290) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) is different from false [2022-11-02 21:05:31,936 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_2290 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2290) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_2292 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2292) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (<= |c_ULTIMATE.start_dll_update_at_~data#1| .cse1) (<= .cse1 |c_ULTIMATE.start_dll_update_at_~data#1|))) is different from false [2022-11-02 21:05:31,963 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:31,963 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 50 treesize of output 43 [2022-11-02 21:05:31,974 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 17 treesize of output 13 [2022-11-02 21:05:32,668 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2288 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2022-11-02 21:05:33,117 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2288 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2022-11-02 21:05:33,558 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2288 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2022-11-02 21:05:34,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2288 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2022-11-02 21:05:34,041 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2288 Int) (v_ArrVal_2287 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) is different from false [2022-11-02 21:05:34,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2285 Int) (v_ArrVal_2288 Int) (v_ArrVal_2287 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2285)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))) is different from false [2022-11-02 21:05:34,079 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:34,079 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-11-02 21:05:34,084 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 45 treesize of output 41 [2022-11-02 21:05:34,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:34,089 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 29 treesize of output 25 [2022-11-02 21:05:34,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:34,093 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 31 treesize of output 23 [2022-11-02 21:05:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-02 21:05:34,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709159972] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:34,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:34,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 26] total 56 [2022-11-02 21:05:34,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178101667] [2022-11-02 21:05:34,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:34,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-02 21:05:34,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:34,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-02 21:05:34,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2127, Unknown=8, NotChecked=792, Total=3080 [2022-11-02 21:05:34,202 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand has 56 states, 56 states have (on average 2.357142857142857) internal successors, (132), 56 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:35,142 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_2288 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) .cse2))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-11-02 21:05:35,556 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_2288 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (not (= (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (not (= (select .cse0 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2022-11-02 21:05:35,995 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_2288 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (not (= (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (not (= (select .cse0 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2022-11-02 21:05:36,420 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (not (= (select .cse0 4) |c_ULTIMATE.start_dll_create_#res#1.base|)) (forall ((v_ArrVal_2288 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2022-11-02 21:05:36,870 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse0 4))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2288 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2022-11-02 21:05:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:38,465 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-11-02 21:05:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 21:05:38,466 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.357142857142857) internal successors, (132), 56 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-02 21:05:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:38,467 INFO L225 Difference]: With dead ends: 68 [2022-11-02 21:05:38,467 INFO L226 Difference]: Without dead ends: 68 [2022-11-02 21:05:38,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=355, Invalid=3844, Unknown=13, NotChecked=1794, Total=6006 [2022-11-02 21:05:38,470 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 153 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 462 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:38,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 811 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 979 Invalid, 0 Unknown, 462 Unchecked, 0.7s Time] [2022-11-02 21:05:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-02 21:05:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-02 21:05:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.096774193548387) internal successors, (68), 67 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2022-11-02 21:05:38,473 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 52 [2022-11-02 21:05:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:38,473 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2022-11-02 21:05:38,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.357142857142857) internal successors, (132), 56 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-11-02 21:05:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 21:05:38,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:38,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:38,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:38,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-02 21:05:38,686 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:38,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317609, now seen corresponding path program 1 times [2022-11-02 21:05:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:38,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974775306] [2022-11-02 21:05:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-02 21:05:38,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:38,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974775306] [2022-11-02 21:05:38,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974775306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:38,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:38,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:38,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46052766] [2022-11-02 21:05:38,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:38,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:05:38,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:38,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:05:38,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:38,836 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:39,003 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-11-02 21:05:39,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:05:39,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-02 21:05:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:39,004 INFO L225 Difference]: With dead ends: 79 [2022-11-02 21:05:39,005 INFO L226 Difference]: Without dead ends: 79 [2022-11-02 21:05:39,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:05:39,006 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 141 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:39,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 75 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-02 21:05:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-11-02 21:05:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.109375) internal successors, (71), 68 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2022-11-02 21:05:39,011 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 56 [2022-11-02 21:05:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:39,012 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2022-11-02 21:05:39,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-11-02 21:05:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 21:05:39,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:39,017 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:39,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 21:05:39,017 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:39,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:39,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317608, now seen corresponding path program 1 times [2022-11-02 21:05:39,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:39,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066299598] [2022-11-02 21:05:39,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:39,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 21:05:39,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:39,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066299598] [2022-11-02 21:05:39,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066299598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:39,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:39,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326471094] [2022-11-02 21:05:39,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:39,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:05:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:39,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:05:39,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:39,315 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:39,514 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-11-02 21:05:39,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:39,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-02 21:05:39,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:39,515 INFO L225 Difference]: With dead ends: 77 [2022-11-02 21:05:39,515 INFO L226 Difference]: Without dead ends: 77 [2022-11-02 21:05:39,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:05:39,516 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 177 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:39,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 50 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:39,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-02 21:05:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-11-02 21:05:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-11-02 21:05:39,519 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 56 [2022-11-02 21:05:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:39,519 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-11-02 21:05:39,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-11-02 21:05:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-02 21:05:39,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:39,520 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:39,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 21:05:39,520 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:39,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:39,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1291305133, now seen corresponding path program 1 times [2022-11-02 21:05:39,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:39,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977740211] [2022-11-02 21:05:39,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:39,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 21:05:39,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:39,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977740211] [2022-11-02 21:05:39,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977740211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:39,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:39,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:05:39,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090829803] [2022-11-02 21:05:39,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:39,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:05:39,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:39,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:05:39,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:39,634 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:39,751 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-11-02 21:05:39,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:39,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-11-02 21:05:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:39,753 INFO L225 Difference]: With dead ends: 74 [2022-11-02 21:05:39,753 INFO L226 Difference]: Without dead ends: 74 [2022-11-02 21:05:39,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:05:39,753 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 164 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:39,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 76 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-02 21:05:39,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-11-02 21:05:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 70 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-11-02 21:05:39,756 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 57 [2022-11-02 21:05:39,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:39,756 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-11-02 21:05:39,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-11-02 21:05:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 21:05:39,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:39,757 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:39,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 21:05:39,757 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:39,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash 302765524, now seen corresponding path program 1 times [2022-11-02 21:05:39,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:39,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085633172] [2022-11-02 21:05:39,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:39,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 21:05:39,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:39,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085633172] [2022-11-02 21:05:39,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085633172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:39,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:39,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:39,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701302593] [2022-11-02 21:05:39,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:39,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:05:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:39,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:05:39,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:39,904 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:40,049 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-11-02 21:05:40,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:40,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-02 21:05:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:40,050 INFO L225 Difference]: With dead ends: 72 [2022-11-02 21:05:40,051 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 21:05:40,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:05:40,051 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 150 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:40,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 63 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:40,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 21:05:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-02 21:05:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 71 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2022-11-02 21:05:40,054 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2022-11-02 21:05:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:40,054 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2022-11-02 21:05:40,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-11-02 21:05:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 21:05:40,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:40,055 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:40,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 21:05:40,055 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:40,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash 256575356, now seen corresponding path program 1 times [2022-11-02 21:05:40,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:40,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068212927] [2022-11-02 21:05:40,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:40,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 21:05:41,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:41,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068212927] [2022-11-02 21:05:41,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068212927] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:41,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939453737] [2022-11-02 21:05:41,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:41,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:41,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:41,432 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:41,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-02 21:05:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-02 21:05:41,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:41,778 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 21:05:41,822 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:41,823 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 21:05:41,882 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 21:05:41,930 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 23 treesize of output 22 [2022-11-02 21:05:41,961 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:41,961 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 23 treesize of output 26 [2022-11-02 21:05:42,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:42,159 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 20 treesize of output 19 [2022-11-02 21:05:42,308 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:42,309 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 28 treesize of output 29 [2022-11-02 21:05:42,496 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:42,497 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 27 treesize of output 21 [2022-11-02 21:05:42,681 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:42,681 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 21:05:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 21:05:42,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:42,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:42,994 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 31 treesize of output 35 [2022-11-02 21:05:43,017 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2653) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_prenex_5 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_dll_update_at_~head#1.base|))) is different from false [2022-11-02 21:05:43,034 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2653 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2653) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_5 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) is different from false [2022-11-02 21:05:43,045 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_2653 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2653) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_5 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2022-11-02 21:05:43,063 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_prenex_5 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.base|) 4) .cse0)) (forall ((v_ArrVal_2653 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2653) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))))) is different from false [2022-11-02 21:05:43,088 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2652)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2652)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_2653)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) is different from false [2022-11-02 21:05:43,119 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse4 (select .cse3 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3) .cse4 v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.base|) 4) .cse4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-11-02 21:05:43,148 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) (select .cse0 .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_ULTIMATE.start_dll_create_#res#1.base|))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse4 (select .cse3 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse3) .cse4 v_prenex_5) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) .cse4)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-11-02 21:05:43,178 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse3 (select .cse4 .cse1))) (= .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse4) .cse3 v_prenex_5) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-11-02 21:05:43,225 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) .cse1 v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) .cse1)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse4 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) (select .cse4 .cse2) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-11-02 21:05:43,252 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 .cse2) v_ArrVal_2653))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse5 (select .cse4 .cse2))) (= (select (select (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) .cse5 v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) .cse5))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-11-02 21:05:43,295 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int) (v_ArrVal_2648 Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2648)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 .cse2) v_ArrVal_2653))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int) (v_ArrVal_2648 Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2648)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse7 (select .cse6 .cse2))) (= (select (select (store (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6) .cse7 v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) .cse7))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-11-02 21:05:43,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:43,315 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 58 [2022-11-02 21:05:43,320 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 105 treesize of output 97 [2022-11-02 21:05:43,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:43,335 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:43,335 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 93 treesize of output 92 [2022-11-02 21:05:43,341 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 83 treesize of output 79 [2022-11-02 21:05:43,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:43,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:43,355 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 93 treesize of output 87 [2022-11-02 21:05:43,427 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 21:05:43,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 1 [2022-11-02 21:05:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 13 not checked. [2022-11-02 21:05:43,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939453737] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:43,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:43,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 50 [2022-11-02 21:05:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680439320] [2022-11-02 21:05:43,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:43,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-02 21:05:43,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:43,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-02 21:05:43,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1444, Unknown=11, NotChecked=946, Total=2550 [2022-11-02 21:05:43,533 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand has 51 states, 50 states have (on average 2.66) internal successors, (133), 51 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:47,912 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select .cse0 .cse1) 1) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (select .cse3 .cse4) v_ArrVal_2653))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse7 (select .cse6 .cse4))) (= (select (select (store (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6) .cse7 v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) .cse7))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|)))))) is different from false [2022-11-02 21:05:47,919 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) .cse0) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 .cse3) v_ArrVal_2653))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse6 (select .cse5 .cse3))) (= (select (select (store (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) .cse6 v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) .cse6))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|)))))) is different from false [2022-11-02 21:05:47,925 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) .cse1 v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) .cse1)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select .cse3 .cse2)) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse4 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) (select .cse4 .cse2) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-11-02 21:05:47,930 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) (select .cse2 4)) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse3 (select .cse4 .cse1))) (= .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse4) .cse3 v_prenex_5) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-11-02 21:05:47,936 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) (select .cse0 .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_ULTIMATE.start_dll_create_#res#1.base|))))) (= 1 (select (store |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base| 0) (select .cse2 4))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse4 (select .cse3 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse3) .cse4 v_prenex_5) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) .cse4)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2022-11-02 21:05:47,942 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select .cse2 4)) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse4 (select .cse3 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3) .cse4 v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.base|) 4) .cse4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-11-02 21:05:48,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:48,940 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-11-02 21:05:48,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 21:05:48,941 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.66) internal successors, (133), 51 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-02 21:05:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:48,942 INFO L225 Difference]: With dead ends: 79 [2022-11-02 21:05:48,942 INFO L226 Difference]: Without dead ends: 79 [2022-11-02 21:05:48,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 94 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=300, Invalid=2507, Unknown=17, NotChecked=2006, Total=4830 [2022-11-02 21:05:48,944 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 174 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 677 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:48,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 495 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 764 Invalid, 0 Unknown, 677 Unchecked, 0.6s Time] [2022-11-02 21:05:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-02 21:05:48,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2022-11-02 21:05:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-11-02 21:05:48,947 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 62 [2022-11-02 21:05:48,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:48,947 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-11-02 21:05:48,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.66) internal successors, (133), 51 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-11-02 21:05:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 21:05:48,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:48,949 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:48,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:49,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-02 21:05:49,158 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:49,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:49,158 INFO L85 PathProgramCache]: Analyzing trace with hash 256575357, now seen corresponding path program 1 times [2022-11-02 21:05:49,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:49,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537970566] [2022-11-02 21:05:49,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 21:05:51,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:51,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537970566] [2022-11-02 21:05:51,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537970566] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:51,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106153581] [2022-11-02 21:05:51,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:51,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:51,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:51,534 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:51,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-02 21:05:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:51,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-02 21:05:51,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:51,791 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 21:05:51,877 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:51,878 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 21:05:51,939 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 21:05:51,945 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 21:05:52,007 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 23 treesize of output 22 [2022-11-02 21:05:52,016 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 23 treesize of output 22 [2022-11-02 21:05:52,051 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:52,052 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 54 treesize of output 53 [2022-11-02 21:05:52,056 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 41 treesize of output 41 [2022-11-02 21:05:52,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:52,428 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 34 treesize of output 29 [2022-11-02 21:05:52,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:52,437 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 35 treesize of output 30 [2022-11-02 21:05:52,756 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:52,757 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 44 treesize of output 43 [2022-11-02 21:05:52,763 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 21:05:53,102 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:53,103 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 32 treesize of output 26 [2022-11-02 21:05:53,113 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:53,114 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 29 treesize of output 23 [2022-11-02 21:05:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 21:05:53,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:53,947 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2022-11-02 21:05:53,972 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2022-11-02 21:05:53,984 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2790 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) is different from false [2022-11-02 21:05:54,007 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))))) is different from false [2022-11-02 21:05:54,038 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2788)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2786)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2786)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2788)) .cse3 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))))) is different from false [2022-11-02 21:05:54,076 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse1 (select .cse2 .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse1 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse1 v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse3) v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))))))) is different from false [2022-11-02 21:05:54,108 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse2) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 4))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse4 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse3 (select .cse4 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse3 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse4) .cse3 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))))) is different from false [2022-11-02 21:05:54,147 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse1 (select .cse2 .cse3))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse1 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2) .cse1 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse3) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 4))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))))) is different from false [2022-11-02 21:05:54,204 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse1 (select .cse2 .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse1 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) .cse1 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse3) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))))))) is different from false [2022-11-02 21:05:54,245 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:54,246 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 129 treesize of output 133 [2022-11-02 21:05:54,355 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int))) (< (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_8))) (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_10))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7) .cse1) v_prenex_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_2789 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7))) (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (select .cse3 .cse1) v_ArrVal_2789))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_2786 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (<= 0 (+ (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2783))) (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2782) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse1) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))))) is different from false [2022-11-02 21:05:54,432 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_6 Int) (v_ArrVal_2780 Int) (v_ArrVal_2778 Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int))) (< (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse2 v_ArrVal_2780)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_8))) (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_10))) (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse2 v_ArrVal_2778)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7) .cse4) v_prenex_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (forall ((v_prenex_6 Int) (v_ArrVal_2778 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_2789 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse2 v_ArrVal_2778)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7))) (store (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6) (select .cse6 .cse4) v_ArrVal_2789))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (forall ((v_ArrVal_2780 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_2786 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2788 Int) (v_ArrVal_2778 Int) (v_ArrVal_2790 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (<= 0 (+ (select (select (store (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse2 v_ArrVal_2780)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2783))) (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788))) (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse2 v_ArrVal_2778)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2782) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse4) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))))) is different from false [2022-11-02 21:05:54,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:54,462 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 74 [2022-11-02 21:05:54,476 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:54,476 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 59 [2022-11-02 21:05:54,483 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 88 treesize of output 84 [2022-11-02 21:05:54,490 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 208 treesize of output 202 [2022-11-02 21:05:54,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:54,499 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 84 treesize of output 68 [2022-11-02 21:05:54,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:54,508 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 94 treesize of output 74 [2022-11-02 21:05:54,527 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:54,527 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 170 treesize of output 170 [2022-11-02 21:05:54,535 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 158 treesize of output 150 [2022-11-02 21:05:54,541 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 174 treesize of output 170 [2022-11-02 21:05:54,689 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 21:05:54,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 1 [2022-11-02 21:05:54,697 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 21:05:54,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 1 [2022-11-02 21:05:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 13 not checked. [2022-11-02 21:05:55,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106153581] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:55,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:55,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 21] total 61 [2022-11-02 21:05:55,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120599386] [2022-11-02 21:05:55,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:55,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-02 21:05:55,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:55,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-02 21:05:55,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2388, Unknown=11, NotChecked=1188, Total=3782 [2022-11-02 21:05:55,005 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 62 states, 61 states have (on average 2.6885245901639343) internal successors, (164), 62 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:55,631 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) .cse1 (= .cse2 0) (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int))) (< (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_8))) (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_10))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7) .cse4) v_prenex_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_2789 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7))) (store (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6) (select .cse6 .cse4) v_ArrVal_2789))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_2786 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (<= 0 (+ (select (select (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2783))) (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2782) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse4) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse2) (let ((.cse8 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and .cse1 (<= 12 .cse8)) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= .cse8 11)))))))) is different from false [2022-11-02 21:05:55,639 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) .cse1 (= .cse2 0) (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int))) (< (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_8))) (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_10))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7) .cse4) v_prenex_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_2789 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7))) (store (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6) (select .cse6 .cse4) v_ArrVal_2789))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_2786 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (<= 0 (+ (select (select (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2783))) (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2782) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse4) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse2) (let ((.cse8 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and .cse1 (<= 12 .cse8)) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= .cse8 11)))))))) is different from false [2022-11-02 21:05:55,646 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse5 (select .cse4 .cse3)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse1 (select .cse2 .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse1 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) .cse1 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select .cse0 .cse3) 0) (<= 12 (select |c_#length| .cse5)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse3) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))))))) is different from false [2022-11-02 21:05:55,653 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse5 (select .cse4 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse1 (select .cse2 .cse3))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse1 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2) .cse1 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse3) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 4))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (= (select .cse0 4) 0) (<= 12 (select |c_#length| .cse5)) (not (= .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-11-02 21:05:55,659 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse3 (select .cse1 4)) (.cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse2) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 4))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (not (= .cse3 |c_ULTIMATE.start_dll_create_#res#1.base|)) (<= 12 (select |c_#length| .cse3)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse5 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse4 (select .cse5 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse4 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse5) .cse4 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select .cse0 4) 0)))) is different from false [2022-11-02 21:05:55,666 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse5 4)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select .cse1 4) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse3 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse2 (select .cse3 .cse4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse2 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3) .cse2 v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))))) (<= 12 (select |c_#length| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse4) v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))))))) is different from false [2022-11-02 21:05:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:57,540 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2022-11-02 21:05:57,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 21:05:57,541 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.6885245901639343) internal successors, (164), 62 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-02 21:05:57,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:57,541 INFO L225 Difference]: With dead ends: 83 [2022-11-02 21:05:57,541 INFO L226 Difference]: Without dead ends: 83 [2022-11-02 21:05:57,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=387, Invalid=3954, Unknown=17, NotChecked=2448, Total=6806 [2022-11-02 21:05:57,543 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 168 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 958 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:57,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 849 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 967 Invalid, 0 Unknown, 958 Unchecked, 0.8s Time] [2022-11-02 21:05:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-02 21:05:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-11-02 21:05:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-11-02 21:05:57,546 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 62 [2022-11-02 21:05:57,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:57,546 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-11-02 21:05:57,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.6885245901639343) internal successors, (164), 62 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:57,546 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-11-02 21:05:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:05:57,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:57,547 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:57,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:57,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-02 21:05:57,754 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:05:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:57,754 INFO L85 PathProgramCache]: Analyzing trace with hash -636099954, now seen corresponding path program 1 times [2022-11-02 21:05:57,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:57,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244057385] [2022-11-02 21:05:57,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:57,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:05:59,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:59,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244057385] [2022-11-02 21:05:59,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244057385] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:59,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548953219] [2022-11-02 21:05:59,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:59,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:59,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:59,085 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:59,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-02 21:05:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:59,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-02 21:05:59,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:59,395 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 21:05:59,521 INFO L356 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-11-02 21:05:59,521 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 3 case distinctions, treesize of input 22 treesize of output 29 [2022-11-02 21:05:59,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:59,657 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 23 treesize of output 22 [2022-11-02 21:05:59,692 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:59,692 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-02 21:06:00,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:00,019 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 29 treesize of output 24 [2022-11-02 21:06:00,131 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 21:06:00,131 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 1 case distinctions, treesize of input 29 treesize of output 32 [2022-11-02 21:06:00,544 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-11-02 21:06:00,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 21:06:00,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:00,648 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 16 [2022-11-02 21:06:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:06:00,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:08,979 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:08,980 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 213 treesize of output 113 [2022-11-02 21:07:09,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:09,004 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 1447 treesize of output 1389 [2022-11-02 21:07:09,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:07:09,042 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:09,043 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 1981 treesize of output 1885 [2022-11-02 21:07:10,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:07:10,168 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:10,169 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 362 treesize of output 340 [2022-11-02 21:07:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 9 refuted. 9 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:07:36,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548953219] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:36,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:36,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 56 [2022-11-02 21:07:36,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740864395] [2022-11-02 21:07:36,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:36,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-02 21:07:36,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-02 21:07:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2745, Unknown=67, NotChecked=0, Total=3080 [2022-11-02 21:07:36,999 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 56 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:39,162 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse0 (select |c_#valid| 0))) (and (= .cse0 0) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or .cse1 (forall ((v_arrayElimCell_153 Int)) (not (= (select |c_#valid| v_arrayElimCell_153) 1)))) (forall ((v_ArrVal_2919 Int) (v_ArrVal_2918 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.base_47| Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_45| Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| v_ArrVal_2918)))) (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.base_47| (store (select .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.base_47|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_45| v_ArrVal_2919))) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (not (= (select |c_#valid| (select .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 1)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|) (not (= (select .cse2 4) 0))))) (not (= .cse0 1)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2022-11-02 21:07:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:41,057 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-11-02 21:07:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 21:07:41,057 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-11-02 21:07:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:41,058 INFO L225 Difference]: With dead ends: 80 [2022-11-02 21:07:41,058 INFO L226 Difference]: Without dead ends: 80 [2022-11-02 21:07:41,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 98.9s TimeCoverageRelationStatistics Valid=722, Invalid=4914, Unknown=68, NotChecked=148, Total=5852 [2022-11-02 21:07:41,060 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 340 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:41,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 686 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 680 Invalid, 0 Unknown, 201 Unchecked, 0.5s Time] [2022-11-02 21:07:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-02 21:07:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-11-02 21:07:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 76 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-11-02 21:07:41,063 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 63 [2022-11-02 21:07:41,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:41,063 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-11-02 21:07:41,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-11-02 21:07:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:07:41,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:41,064 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:41,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:41,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:41,290 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:07:41,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:41,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1405249969, now seen corresponding path program 1 times [2022-11-02 21:07:41,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:41,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82522409] [2022-11-02 21:07:41,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:41,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:07:42,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:42,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82522409] [2022-11-02 21:07:42,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82522409] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:42,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497974399] [2022-11-02 21:07:42,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:42,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:42,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:42,705 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:42,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-02 21:07:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:42,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-02 21:07:42,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:42,972 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 21:07:43,043 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:43,043 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 21:07:43,069 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 21:07:43,141 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 23 treesize of output 22 [2022-11-02 21:07:43,182 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:07:43,182 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 34 treesize of output 35 [2022-11-02 21:07:43,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:43,310 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 29 treesize of output 24 [2022-11-02 21:07:43,549 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:07:43,549 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 28 treesize of output 29 [2022-11-02 21:07:43,783 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:43,783 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 27 treesize of output 21 [2022-11-02 21:07:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 21:07:43,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:44,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_3048) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-02 21:07:44,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_3048) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-02 21:07:44,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_3048) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-02 21:07:44,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_3048) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-02 21:07:44,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int)) (v_ArrVal_3046 Int)) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_3046)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-02 21:07:44,219 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 21:07:44,231 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 21:07:44,243 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 21:07:44,261 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 21:07:44,283 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3044 (Array Int Int)) (v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3044))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3048))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 21:07:44,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3044 (Array Int Int)) (v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int) (v_ArrVal_3042 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3042)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3044))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3048))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 21:07:44,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:44,325 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 57 [2022-11-02 21:07:44,330 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 100 treesize of output 92 [2022-11-02 21:07:44,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:07:44,347 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:44,348 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 45 treesize of output 44 [2022-11-02 21:07:44,353 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 78 treesize of output 74 [2022-11-02 21:07:44,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:07:44,368 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:44,369 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 53 treesize of output 47 [2022-11-02 21:07:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 13 not checked. [2022-11-02 21:07:44,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497974399] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:44,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:44,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 21] total 46 [2022-11-02 21:07:44,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066955037] [2022-11-02 21:07:44,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:44,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-02 21:07:44,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:44,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-02 21:07:44,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1159, Unknown=11, NotChecked=858, Total=2162 [2022-11-02 21:07:44,639 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:45,007 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_3044 (Array Int Int)) (v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3044))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 .cse2) v_ArrVal_3048))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|))) is different from false [2022-11-02 21:07:45,012 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_3044 (Array Int Int)) (v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3044))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 .cse2) v_ArrVal_3048))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|))) is different from false [2022-11-02 21:07:45,020 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select .cse2 .cse1))) (and (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (select .cse0 .cse1) v_ArrVal_3048)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ .cse3 1) |c_#StackHeapBarrier|)))) is different from false [2022-11-02 21:07:45,025 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse0 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|))) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (not (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-11-02 21:07:45,030 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse0 (select .cse2 4))) (and (not (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse1 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_#StackHeapBarrier|))) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0)))) is different from false [2022-11-02 21:07:45,035 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse2 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse1 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|)))) is different from false [2022-11-02 21:07:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:46,060 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-11-02 21:07:46,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 21:07:46,061 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-02 21:07:46,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:46,062 INFO L225 Difference]: With dead ends: 78 [2022-11-02 21:07:46,062 INFO L226 Difference]: Without dead ends: 78 [2022-11-02 21:07:46,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 65 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=310, Invalid=2191, Unknown=17, NotChecked=1904, Total=4422 [2022-11-02 21:07:46,063 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 195 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 729 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:46,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 560 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 602 Invalid, 0 Unknown, 729 Unchecked, 0.5s Time] [2022-11-02 21:07:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-02 21:07:46,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-02 21:07:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 77 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2022-11-02 21:07:46,066 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 65 [2022-11-02 21:07:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:46,067 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2022-11-02 21:07:46,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-11-02 21:07:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 21:07:46,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:46,068 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:46,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:46,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-02 21:07:46,278 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 21:07:46,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:46,278 INFO L85 PathProgramCache]: Analyzing trace with hash -755420895, now seen corresponding path program 2 times [2022-11-02 21:07:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:46,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010428861] [2022-11-02 21:07:46,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:46,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:07:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:49,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010428861] [2022-11-02 21:07:49,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010428861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:49,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233079431] [2022-11-02 21:07:49,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:07:49,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:49,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:49,254 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:49,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2991bc8f-8b28-429b-99cc-e821ec452c14/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-02 21:07:49,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:07:49,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:49,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 145 conjunts are in the unsatisfiable core [2022-11-02 21:07:49,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:49,572 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 21:07:49,603 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 21:07:49,609 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 21:07:49,625 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 23 treesize of output 22 [2022-11-02 21:07:49,633 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 23 treesize of output 22 [2022-11-02 21:07:49,717 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:49,717 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 21:07:49,800 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 21:07:49,808 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 21:07:49,833 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 21 treesize of output 20 [2022-11-02 21:07:49,844 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 21 treesize of output 20 [2022-11-02 21:07:49,931 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 26 treesize of output 28 [2022-11-02 21:07:49,939 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 26 treesize of output 28 [2022-11-02 21:07:50,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:50,024 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:07:50,025 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 1 case distinctions, treesize of input 81 treesize of output 62 [2022-11-02 21:07:50,039 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-02 21:07:50,039 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 1 case distinctions, treesize of input 61 treesize of output 54 [2022-11-02 21:07:50,590 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-02 21:07:50,590 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 49 [2022-11-02 21:07:50,641 INFO L356 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-11-02 21:07:50,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 53 [2022-11-02 21:07:51,888 INFO L356 Elim1Store]: treesize reduction 172, result has 51.5 percent of original size [2022-11-02 21:07:51,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 131 treesize of output 259 [2022-11-02 21:07:52,072 INFO L356 Elim1Store]: treesize reduction 92, result has 51.3 percent of original size [2022-11-02 21:07:52,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 199 treesize of output 240 [2022-11-02 21:08:01,319 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 21:08:01,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:08:01,489 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-02 21:08:01,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 41 [2022-11-02 21:08:01,506 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 21:08:01,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-11-02 21:08:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:08:01,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:01,854 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 10 treesize of output 8