./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF --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 c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 07:13:00,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:13:00,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:13:00,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:13:00,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:13:00,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:13:00,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:13:00,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:13:00,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:13:00,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:13:00,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:13:00,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:13:00,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:13:00,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:13:00,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:13:00,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:13:00,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:13:00,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:13:00,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:13:00,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:13:00,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:13:00,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:13:00,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:13:00,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:13:00,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:13:00,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:13:00,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:13:00,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:13:00,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:13:00,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:13:00,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:13:00,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:13:00,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:13:00,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:13:00,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:13:00,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:13:00,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:13:00,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:13:00,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:13:00,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:13:00,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:13:00,786 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-20 07:13:00,829 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:13:00,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:13:00,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:13:00,846 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:13:00,853 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:13:00,854 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:13:00,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:13:00,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:13:00,855 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:13:00,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:13:00,856 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 07:13:00,856 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 07:13:00,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 07:13:00,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 07:13:00,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:13:00,857 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 07:13:00,858 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 07:13:00,858 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-20 07:13:00,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:13:00,858 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 07:13:00,859 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 07:13:00,859 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:13:00,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:13:00,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:13:00,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:13:00,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:13:00,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:13:00,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:13:00,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 07:13:00,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 07:13:00,861 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:13:00,861 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_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/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_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF 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 -> c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc [2021-11-20 07:13:01,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:13:01,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:13:01,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:13:01,125 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:13:01,125 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:13:01,127 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2021-11-20 07:13:01,200 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/data/4bb1a1e87/22a03e80ffd84c4fac2e8c8e6d554d0a/FLAG11321e8f5 [2021-11-20 07:13:01,748 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:13:01,754 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2021-11-20 07:13:01,772 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/data/4bb1a1e87/22a03e80ffd84c4fac2e8c8e6d554d0a/FLAG11321e8f5 [2021-11-20 07:13:02,043 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/data/4bb1a1e87/22a03e80ffd84c4fac2e8c8e6d554d0a [2021-11-20 07:13:02,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:13:02,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:13:02,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:13:02,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:13:02,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:13:02,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:13:02" (1/1) ... [2021-11-20 07:13:02,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a8408d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:02, skipping insertion in model container [2021-11-20 07:13:02,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:13:02" (1/1) ... [2021-11-20 07:13:02,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:13:02,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:13:02,427 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_b1c8a737-3f7d-4888-8675-ba4a94112b6c/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2021-11-20 07:13:02,430 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:13:02,437 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:13:02,475 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_b1c8a737-3f7d-4888-8675-ba4a94112b6c/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2021-11-20 07:13:02,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:13:02,515 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:13:02,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:02 WrapperNode [2021-11-20 07:13:02,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:13:02,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:13:02,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:13:02,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:13:02,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:02" (1/1) ... [2021-11-20 07:13:02,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:02" (1/1) ... [2021-11-20 07:13:02,595 INFO L137 Inliner]: procedures = 122, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2021-11-20 07:13:02,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:13:02,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:13:02,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:13:02,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:13:02,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:02" (1/1) ... [2021-11-20 07:13:02,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:02" (1/1) ... [2021-11-20 07:13:02,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:02" (1/1) ... [2021-11-20 07:13:02,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:02" (1/1) ... [2021-11-20 07:13:02,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:02" (1/1) ... [2021-11-20 07:13:02,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:02" (1/1) ... [2021-11-20 07:13:02,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:02" (1/1) ... [2021-11-20 07:13:02,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:13:02,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:13:02,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:13:02,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:13:02,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:02" (1/1) ... [2021-11-20 07:13:02,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:13:02,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:13:02,692 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:13:02,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:13:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-11-20 07:13:02,754 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-11-20 07:13:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 07:13:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 07:13:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 07:13:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:13:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 07:13:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 07:13:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 07:13:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 07:13:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:13:02,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:13:02,878 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:13:02,881 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:13:02,938 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-11-20 07:13:03,140 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:13:03,146 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:13:03,147 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-20 07:13:03,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:13:03 BoogieIcfgContainer [2021-11-20 07:13:03,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:13:03,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:13:03,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:13:03,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:13:03,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:13:02" (1/3) ... [2021-11-20 07:13:03,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fbe956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:13:03, skipping insertion in model container [2021-11-20 07:13:03,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:02" (2/3) ... [2021-11-20 07:13:03,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fbe956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:13:03, skipping insertion in model container [2021-11-20 07:13:03,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:13:03" (3/3) ... [2021-11-20 07:13:03,161 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2021-11-20 07:13:03,167 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:13:03,167 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2021-11-20 07:13:03,238 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:13:03,251 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 07:13:03,251 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-11-20 07:13:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 35 states have (on average 2.0) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:03,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-20 07:13:03,288 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:13:03,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-20 07:13:03,288 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:13:03,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:13:03,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2021-11-20 07:13:03,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:13:03,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345210309] [2021-11-20 07:13:03,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:13:03,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:13:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:13:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:13:03,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:13:03,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345210309] [2021-11-20 07:13:03,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345210309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:13:03,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:13:03,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:13:03,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118495864] [2021-11-20 07:13:03,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:13:03,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:13:03,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:13:03,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:13:03,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:13:03,539 INFO L87 Difference]: Start difference. First operand has 63 states, 35 states have (on average 2.0) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:13:03,621 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-11-20 07:13:03,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:13:03,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-11-20 07:13:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:13:03,631 INFO L225 Difference]: With dead ends: 76 [2021-11-20 07:13:03,631 INFO L226 Difference]: Without dead ends: 70 [2021-11-20 07:13:03,633 INFO L932 BasicCegarLoop]: 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 [2021-11-20 07:13:03,636 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 50 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:13:03,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 55 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:13:03,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-20 07:13:03,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2021-11-20 07:13:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.78125) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2021-11-20 07:13:03,673 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 4 [2021-11-20 07:13:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:13:03,673 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2021-11-20 07:13:03,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2021-11-20 07:13:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-20 07:13:03,674 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:13:03,674 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-20 07:13:03,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 07:13:03,675 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:13:03,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:13:03,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2021-11-20 07:13:03,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:13:03,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229419544] [2021-11-20 07:13:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:13:03,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:13:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:13:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:13:03,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:13:03,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229419544] [2021-11-20 07:13:03,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229419544] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:13:03,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:13:03,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:13:03,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539840818] [2021-11-20 07:13:03,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:13:03,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:13:03,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:13:03,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:13:03,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:13:03,733 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:13:03,775 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2021-11-20 07:13:03,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:13:03,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-11-20 07:13:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:13:03,777 INFO L225 Difference]: With dead ends: 51 [2021-11-20 07:13:03,777 INFO L226 Difference]: Without dead ends: 51 [2021-11-20 07:13:03,778 INFO L932 BasicCegarLoop]: 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 [2021-11-20 07:13:03,779 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:13:03,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 34 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:13:03,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-11-20 07:13:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-11-20 07:13:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.6875) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:03,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2021-11-20 07:13:03,787 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2021-11-20 07:13:03,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:13:03,787 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2021-11-20 07:13:03,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2021-11-20 07:13:03,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-20 07:13:03,788 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:13:03,789 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:13:03,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 07:13:03,789 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:13:03,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:13:03,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2021-11-20 07:13:03,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:13:03,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961461850] [2021-11-20 07:13:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:13:03,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:13:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:13:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:13:03,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:13:03,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961461850] [2021-11-20 07:13:03,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961461850] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:13:03,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:13:03,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:13:03,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412267305] [2021-11-20 07:13:03,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:13:03,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:13:03,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:13:03,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:13:03,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:13:03,842 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 4.5) 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) [2021-11-20 07:13:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:13:03,935 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2021-11-20 07:13:03,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:13:03,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) 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 [2021-11-20 07:13:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:13:03,937 INFO L225 Difference]: With dead ends: 82 [2021-11-20 07:13:03,937 INFO L226 Difference]: Without dead ends: 82 [2021-11-20 07:13:03,937 INFO L932 BasicCegarLoop]: 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 [2021-11-20 07:13:03,939 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:13:03,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 95 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:13:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-11-20 07:13:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2021-11-20 07:13:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.625) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2021-11-20 07:13:03,946 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2021-11-20 07:13:03,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:13:03,946 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2021-11-20 07:13:03,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) 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) [2021-11-20 07:13:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2021-11-20 07:13:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-20 07:13:03,947 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:13:03,947 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:13:03,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 07:13:03,948 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:13:03,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:13:03,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2021-11-20 07:13:03,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:13:03,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98561640] [2021-11-20 07:13:03,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:13:03,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:13:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:13:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:13:04,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:13:04,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98561640] [2021-11-20 07:13:04,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98561640] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:13:04,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:13:04,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:13:04,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696506497] [2021-11-20 07:13:04,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:13:04,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:13:04,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:13:04,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:13:04,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:13:04,062 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 2 states have (on average 4.5) 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) [2021-11-20 07:13:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:13:04,140 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2021-11-20 07:13:04,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:13:04,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) 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 [2021-11-20 07:13:04,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:13:04,144 INFO L225 Difference]: With dead ends: 84 [2021-11-20 07:13:04,144 INFO L226 Difference]: Without dead ends: 84 [2021-11-20 07:13:04,145 INFO L932 BasicCegarLoop]: 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 [2021-11-20 07:13:04,146 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:13:04,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 104 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:13:04,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-20 07:13:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2021-11-20 07:13:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.5625) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2021-11-20 07:13:04,153 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2021-11-20 07:13:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:13:04,153 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2021-11-20 07:13:04,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) 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) [2021-11-20 07:13:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2021-11-20 07:13:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 07:13:04,154 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:13:04,154 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:13:04,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 07:13:04,157 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:13:04,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:13:04,160 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2021-11-20 07:13:04,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:13:04,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792175063] [2021-11-20 07:13:04,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:13:04,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:13:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:13:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:13:04,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:13:04,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792175063] [2021-11-20 07:13:04,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792175063] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:13:04,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:13:04,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:13:04,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113662820] [2021-11-20 07:13:04,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:13:04,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:13:04,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:13:04,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:13:04,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:13:04,288 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:13:04,489 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2021-11-20 07:13:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 07:13:04,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-11-20 07:13:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:13:04,492 INFO L225 Difference]: With dead ends: 92 [2021-11-20 07:13:04,492 INFO L226 Difference]: Without dead ends: 92 [2021-11-20 07:13:04,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:13:04,499 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 177 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:13:04,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 94 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:13:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-20 07:13:04,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2021-11-20 07:13:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2021-11-20 07:13:04,516 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 11 [2021-11-20 07:13:04,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:13:04,517 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2021-11-20 07:13:04,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2021-11-20 07:13:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 07:13:04,522 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:13:04,523 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:13:04,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 07:13:04,523 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:13:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:13:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash 427661501, now seen corresponding path program 1 times [2021-11-20 07:13:04,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:13:04,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746071616] [2021-11-20 07:13:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:13:04,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:13:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:13:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:13:04,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:13:04,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746071616] [2021-11-20 07:13:04,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746071616] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:13:04,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:13:04,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 07:13:04,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342116024] [2021-11-20 07:13:04,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:13:04,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:13:04,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:13:04,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:13:04,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:13:04,598 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:13:04,605 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2021-11-20 07:13:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:13:04,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-11-20 07:13:04,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:13:04,612 INFO L225 Difference]: With dead ends: 48 [2021-11-20 07:13:04,612 INFO L226 Difference]: Without dead ends: 48 [2021-11-20 07:13:04,612 INFO L932 BasicCegarLoop]: 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 [2021-11-20 07:13:04,614 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 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 [2021-11-20 07:13:04,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:13:04,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-11-20 07:13:04,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2021-11-20 07:13:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 43 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) [2021-11-20 07:13:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2021-11-20 07:13:04,623 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 11 [2021-11-20 07:13:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:13:04,624 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2021-11-20 07:13:04,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2021-11-20 07:13:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-20 07:13:04,625 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:13:04,625 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:13:04,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 07:13:04,625 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:13:04,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:13:04,626 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2021-11-20 07:13:04,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:13:04,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475364697] [2021-11-20 07:13:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:13:04,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:13:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:13:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:13:04,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:13:04,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475364697] [2021-11-20 07:13:04,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475364697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:13:04,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:13:04,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:13:04,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178300658] [2021-11-20 07:13:04,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:13:04,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:13:04,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:13:04,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:13:04,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:13:04,731 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:13:04,865 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2021-11-20 07:13:04,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:13:04,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 [2021-11-20 07:13:04,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:13:04,866 INFO L225 Difference]: With dead ends: 64 [2021-11-20 07:13:04,866 INFO L226 Difference]: Without dead ends: 64 [2021-11-20 07:13:04,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:13:04,870 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 124 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:13:04,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 66 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:13:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-20 07:13:04,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 45. [2021-11-20 07:13:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 44 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) [2021-11-20 07:13:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2021-11-20 07:13:04,881 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 16 [2021-11-20 07:13:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:13:04,881 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-11-20 07:13:04,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2021-11-20 07:13:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-20 07:13:04,882 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:13:04,883 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:13:04,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 07:13:04,883 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:13:04,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:13:04,885 INFO L85 PathProgramCache]: Analyzing trace with hash 200371690, now seen corresponding path program 1 times [2021-11-20 07:13:04,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:13:04,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609589482] [2021-11-20 07:13:04,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:13:04,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:13:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:13:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:13:04,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:13:04,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609589482] [2021-11-20 07:13:04,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609589482] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:13:04,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198165883] [2021-11-20 07:13:04,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:13:04,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:13:04,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:13:04,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:13:04,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 07:13:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:13:05,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 07:13:05,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:13:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:13:05,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:13:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:13:05,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198165883] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:13:05,188 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:13:05,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-11-20 07:13:05,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232701663] [2021-11-20 07:13:05,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:13:05,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:13:05,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:13:05,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:13:05,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:13:05,196 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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) [2021-11-20 07:13:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:13:05,215 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-11-20 07:13:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 07:13:05,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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 [2021-11-20 07:13:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:13:05,219 INFO L225 Difference]: With dead ends: 60 [2021-11-20 07:13:05,220 INFO L226 Difference]: Without dead ends: 60 [2021-11-20 07:13:05,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:13:05,221 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 20 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:13:05,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 123 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:13:05,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-20 07:13:05,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-11-20 07:13:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2021-11-20 07:13:05,234 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2021-11-20 07:13:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:13:05,235 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2021-11-20 07:13:05,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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) [2021-11-20 07:13:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2021-11-20 07:13:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 07:13:05,237 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:13:05,237 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:13:05,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 07:13:05,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:13:05,455 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:13:05,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:13:05,456 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 2 times [2021-11-20 07:13:05,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:13:05,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023416302] [2021-11-20 07:13:05,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:13:05,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:13:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:13:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 07:13:05,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:13:05,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023416302] [2021-11-20 07:13:05,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023416302] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:13:05,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:13:05,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:13:05,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475804442] [2021-11-20 07:13:05,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:13:05,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:13:05,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:13:05,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:13:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:13:05,596 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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) [2021-11-20 07:13:05,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:13:05,736 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-11-20 07:13:05,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 07:13:05,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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 31 [2021-11-20 07:13:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:13:05,738 INFO L225 Difference]: With dead ends: 66 [2021-11-20 07:13:05,738 INFO L226 Difference]: Without dead ends: 66 [2021-11-20 07:13:05,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:13:05,739 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 131 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:13:05,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 47 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:13:05,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-20 07:13:05,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2021-11-20 07:13:05,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2021-11-20 07:13:05,744 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 31 [2021-11-20 07:13:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:13:05,744 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2021-11-20 07:13:05,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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) [2021-11-20 07:13:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2021-11-20 07:13:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-20 07:13:05,746 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:13:05,746 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:13:05,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 07:13:05,746 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:13:05,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:13:05,747 INFO L85 PathProgramCache]: Analyzing trace with hash 142544431, now seen corresponding path program 1 times [2021-11-20 07:13:05,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:13:05,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374472469] [2021-11-20 07:13:05,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:13:05,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:13:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:13:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 07:13:06,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:13:06,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374472469] [2021-11-20 07:13:06,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374472469] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:13:06,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014724124] [2021-11-20 07:13:06,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:13:06,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:13:06,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:13:06,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:13:06,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 07:13:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:13:06,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-20 07:13:06,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:13:06,539 INFO L388 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 [2021-11-20 07:13:06,643 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-20 07:13:06,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2021-11-20 07:13:06,748 INFO L388 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 [2021-11-20 07:13:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 07:13:06,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:13:08,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_1 Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_1)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2021-11-20 07:13:10,082 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_1)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)))) is different from false [2021-11-20 07:13:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 7 not checked. [2021-11-20 07:13:10,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014724124] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:13:10,331 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:13:10,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2021-11-20 07:13:10,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542769773] [2021-11-20 07:13:10,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:13:10,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-20 07:13:10,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:13:10,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-20 07:13:10,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=446, Unknown=2, NotChecked=86, Total=600 [2021-11-20 07:13:10,333 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:10,939 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| |c_ULTIMATE.start_sll_circular_create_~data#1|) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_1)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-11-20 07:13:11,407 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data_init~0#1| |c_ULTIMATE.start_sll_circular_create_~data#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4))) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_1 Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_1)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|))) is different from false [2021-11-20 07:13:11,868 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4))) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_1 Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_1)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|))) is different from false [2021-11-20 07:13:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:13:12,102 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2021-11-20 07:13:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 07:13:12,105 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 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 [2021-11-20 07:13:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:13:12,105 INFO L225 Difference]: With dead ends: 63 [2021-11-20 07:13:12,106 INFO L226 Difference]: Without dead ends: 63 [2021-11-20 07:13:12,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=129, Invalid=698, Unknown=5, NotChecked=290, Total=1122 [2021-11-20 07:13:12,107 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:13:12,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 365 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 187 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2021-11-20 07:13:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-20 07:13:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-11-20 07:13:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2021-11-20 07:13:12,111 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 33 [2021-11-20 07:13:12,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:13:12,111 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2021-11-20 07:13:12,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:13:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2021-11-20 07:13:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-20 07:13:12,113 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:13:12,113 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:13:12,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 07:13:12,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-20 07:13:12,314 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:13:12,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:13:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2021-11-20 07:13:12,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:13:12,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575641012] [2021-11-20 07:13:12,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:13:12,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:13:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:13:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:13:12,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:13:12,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575641012] [2021-11-20 07:13:12,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575641012] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:13:12,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860759420] [2021-11-20 07:13:12,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:13:12,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:13:12,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:13:12,610 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:13:12,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 07:13:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:13:12,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-20 07:13:12,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:13:12,751 INFO L388 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 [2021-11-20 07:13:12,796 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 07:13:12,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-20 07:13:12,857 INFO L388 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 17 treesize of output 13 [2021-11-20 07:13:12,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:13:12,899 INFO L388 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 13 [2021-11-20 07:13:12,974 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-20 07:13:12,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2021-11-20 07:13:13,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:13:13,176 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 07:13:13,177 INFO L388 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 49 treesize of output 31 [2021-11-20 07:13:13,205 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 07:13:13,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2021-11-20 07:13:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:13:13,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:13:31,668 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 1)) is different from false [2021-11-20 07:13:32,778 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_3 Int)) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4) v_DerPreprocessor_3)))) (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 1)) is different from false [2021-11-20 07:13:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 3 refuted. 1 times theorem prover too weak. 7 trivial. 2 not checked. [2021-11-20 07:13:34,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860759420] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:13:34,281 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:13:34,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 28 [2021-11-20 07:13:34,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116722810] [2021-11-20 07:13:34,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:13:34,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 07:13:34,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:13:34,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 07:13:34,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=603, Unknown=12, NotChecked=102, Total=812 [2021-11-20 07:13:34,283 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 29 states, 28 states have (on average 2.5) internal successors, (70), 29 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) [2021-11-20 07:14:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:14:02,651 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2021-11-20 07:14:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 07:14:02,651 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5) internal successors, (70), 29 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) Word has length 37 [2021-11-20 07:14:02,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:14:02,652 INFO L225 Difference]: With dead ends: 72 [2021-11-20 07:14:02,652 INFO L226 Difference]: Without dead ends: 72 [2021-11-20 07:14:02,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 49.2s TimeCoverageRelationStatistics Valid=187, Invalid=862, Unknown=15, NotChecked=126, Total=1190 [2021-11-20 07:14:02,653 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:14:02,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 258 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 319 Invalid, 0 Unknown, 161 Unchecked, 0.2s Time] [2021-11-20 07:14:02,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-20 07:14:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2021-11-20 07:14:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 67 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) [2021-11-20 07:14:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2021-11-20 07:14:02,656 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 37 [2021-11-20 07:14:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:14:02,657 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2021-11-20 07:14:02,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5) internal successors, (70), 29 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) [2021-11-20 07:14:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2021-11-20 07:14:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-20 07:14:02,658 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:14:02,658 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:14:02,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 07:14:02,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-20 07:14:02,859 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:14:02,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:14:02,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2021-11-20 07:14:02,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:14:02,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258400831] [2021-11-20 07:14:02,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:14:02,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:14:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:14:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:14:03,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:14:03,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258400831] [2021-11-20 07:14:03,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258400831] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:14:03,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353007100] [2021-11-20 07:14:03,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:14:03,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:14:03,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:14:03,442 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:14:03,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 07:14:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:14:03,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-20 07:14:03,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:14:03,711 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-20 07:14:03,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-11-20 07:14:03,789 INFO L388 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 [2021-11-20 07:14:03,796 INFO L388 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 17 treesize of output 13 [2021-11-20 07:14:03,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:14:03,857 INFO L388 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 13 [2021-11-20 07:14:03,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:14:03,870 INFO L388 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 27 treesize of output 11 [2021-11-20 07:14:03,991 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-20 07:14:03,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2021-11-20 07:14:04,005 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-20 07:14:04,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2021-11-20 07:14:04,916 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-11-20 07:14:04,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 86 [2021-11-20 07:14:04,940 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-11-20 07:14:04,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 55 [2021-11-20 07:14:05,047 INFO L354 Elim1Store]: treesize reduction 33, result has 26.7 percent of original size [2021-11-20 07:14:05,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 70 [2021-11-20 07:14:05,061 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-11-20 07:14:05,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 44 [2021-11-20 07:14:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:14:05,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:14:07,709 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (<= 0 (+ .cse0 4)) (<= (+ .cse0 8) (select |c_#length| .cse1))) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse0))))) is different from false [2021-11-20 07:14:09,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= (+ .cse0 8) (select |c_#length| .cse1)) (<= 0 (+ .cse0 4))) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-11-20 07:14:11,985 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3 v_DerPreprocessor_7)))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3 v_DerPreprocessor_6)))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= (+ .cse0 8) (select |c_#length| .cse1)) (<= 0 (+ .cse0 4))) (and (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1)))))) is different from false [2021-11-20 07:14:15,728 INFO L388 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 30 [2021-11-20 07:14:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 3 not checked. [2021-11-20 07:14:15,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353007100] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:14:15,810 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:14:15,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2021-11-20 07:14:15,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245675294] [2021-11-20 07:14:15,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:14:15,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-20 07:14:15,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:14:15,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-20 07:14:15,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1123, Unknown=3, NotChecked=210, Total=1482 [2021-11-20 07:14:15,816 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 39 states, 38 states have (on average 2.210526315789474) internal successors, (84), 39 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:14:18,079 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse1 (= .cse8 8)) (.cse0 (select |c_#length| .cse10)) (.cse9 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (<= 8 .cse0) .cse1 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= .cse2 0) (forall ((v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse6 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse6 v_DerPreprocessor_7)))) (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse4 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse6 v_DerPreprocessor_6)))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= (+ .cse3 8) (select |c_#length| .cse4)) (<= 0 (+ .cse3 4))) (and (= .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse4)))))) (<= (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) .cse8) (= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (or .cse9 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (or .cse9 .cse1 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (or .cse9 (= .cse0 8) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse10)) (or .cse9 (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-11-20 07:14:20,085 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse0 (select |c_#length| .cse5)) (.cse4 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (<= 8 .cse0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= .cse1 0) (= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= (+ .cse2 8) (select |c_#length| .cse3)) (<= 0 (+ .cse2 4))) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse3) (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (or .cse4 (= .cse0 8) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse5)) (or .cse4 (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-11-20 07:14:22,089 WARN L838 $PredicateComparison]: unable to prove that (and (<= 8 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (= 8 (select |c_#length| .cse0)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (<= 0 (+ .cse1 4)) (<= (+ .cse1 8) (select |c_#length| .cse2))) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse1))))) (= (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) is different from false [2021-11-20 07:14:24,156 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse7 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse0 (select |c_#length| .cse9)) (.cse8 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (<= 8 .cse0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= .cse1 0) (forall ((v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse5 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse5 v_DerPreprocessor_7)))) (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse5 v_DerPreprocessor_6)))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= (+ .cse2 8) (select |c_#length| .cse3)) (<= 0 (+ .cse2 4))) (and (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse3)))))) (<= (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) .cse7) (= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (or .cse8 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (or .cse8 (= .cse7 8) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (or .cse8 (= .cse0 8) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse9)) (or .cse8 (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-11-20 07:14:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:14:24,551 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2021-11-20 07:14:24,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 07:14:24,552 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.210526315789474) internal successors, (84), 39 states have internal predecessors, (84), 0 states have call successors, (0), 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 37 [2021-11-20 07:14:24,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:14:24,553 INFO L225 Difference]: With dead ends: 84 [2021-11-20 07:14:24,553 INFO L226 Difference]: Without dead ends: 84 [2021-11-20 07:14:24,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=234, Invalid=1767, Unknown=7, NotChecked=644, Total=2652 [2021-11-20 07:14:24,555 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 45 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:14:24,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 252 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 367 Invalid, 0 Unknown, 269 Unchecked, 0.3s Time] [2021-11-20 07:14:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-20 07:14:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2021-11-20 07:14:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.280701754385965) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:14:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2021-11-20 07:14:24,559 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 37 [2021-11-20 07:14:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:14:24,560 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2021-11-20 07:14:24,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.210526315789474) internal successors, (84), 39 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:14:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2021-11-20 07:14:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-20 07:14:24,561 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:14:24,561 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:14:24,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-20 07:14:24,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:14:24,771 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:14:24,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:14:24,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1124327534, now seen corresponding path program 1 times [2021-11-20 07:14:24,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:14:24,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804085116] [2021-11-20 07:14:24,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:14:24,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:14:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:14:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 07:14:24,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:14:24,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804085116] [2021-11-20 07:14:24,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804085116] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:14:24,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:14:24,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:14:24,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299791244] [2021-11-20 07:14:24,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:14:24,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 07:14:24,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:14:24,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 07:14:24,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:14:24,886 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:14:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:14:25,057 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2021-11-20 07:14:25,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:14:25,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 38 [2021-11-20 07:14:25,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:14:25,058 INFO L225 Difference]: With dead ends: 79 [2021-11-20 07:14:25,058 INFO L226 Difference]: Without dead ends: 79 [2021-11-20 07:14:25,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-20 07:14:25,060 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 205 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:14:25,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 43 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:14:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-20 07:14:25,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2021-11-20 07:14:25,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 72 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) [2021-11-20 07:14:25,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2021-11-20 07:14:25,064 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 38 [2021-11-20 07:14:25,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:14:25,065 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2021-11-20 07:14:25,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:14:25,065 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2021-11-20 07:14:25,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-20 07:14:25,066 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:14:25,066 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:14:25,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-20 07:14:25,067 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:14:25,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:14:25,067 INFO L85 PathProgramCache]: Analyzing trace with hash -494379314, now seen corresponding path program 1 times [2021-11-20 07:14:25,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:14:25,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884768789] [2021-11-20 07:14:25,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:14:25,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:14:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:14:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-20 07:14:25,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:14:25,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884768789] [2021-11-20 07:14:25,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884768789] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:14:25,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:14:25,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:14:25,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372391651] [2021-11-20 07:14:25,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:14:25,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:14:25,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:14:25,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:14:25,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:14:25,115 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:14:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:14:25,156 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2021-11-20 07:14:25,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:14:25,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 [2021-11-20 07:14:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:14:25,158 INFO L225 Difference]: With dead ends: 72 [2021-11-20 07:14:25,158 INFO L226 Difference]: Without dead ends: 72 [2021-11-20 07:14:25,158 INFO L932 BasicCegarLoop]: 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 [2021-11-20 07:14:25,159 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:14:25,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 44 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:14:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-20 07:14:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-11-20 07:14:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 71 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) [2021-11-20 07:14:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2021-11-20 07:14:25,164 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 39 [2021-11-20 07:14:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:14:25,164 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2021-11-20 07:14:25,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:14:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2021-11-20 07:14:25,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-20 07:14:25,166 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:14:25,166 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:14:25,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-20 07:14:25,167 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-20 07:14:25,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:14:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash -494379329, now seen corresponding path program 1 times [2021-11-20 07:14:25,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:14:25,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427761215] [2021-11-20 07:14:25,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:14:25,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:14:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:14:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:14:25,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:14:25,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427761215] [2021-11-20 07:14:25,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427761215] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:14:25,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992490722] [2021-11-20 07:14:25,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:14:25,874 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:14:25,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:14:25,875 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:14:25,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1c8a737-3f7d-4888-8675-ba4a94112b6c/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 07:14:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:14:25,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 57 conjunts are in the unsatisfiable core [2021-11-20 07:14:25,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:14:26,205 INFO L388 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 [2021-11-20 07:14:26,405 INFO L388 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 [2021-11-20 07:14:26,416 INFO L388 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 34 treesize of output 30 [2021-11-20 07:14:26,420 INFO L388 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 27 treesize of output 15 [2021-11-20 07:14:26,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:14:26,489 INFO L388 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 27 treesize of output 11 [2021-11-20 07:14:26,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:14:26,499 INFO L388 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 44 treesize of output 28 [2021-11-20 07:14:26,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 07:14:26,512 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-11-20 07:14:26,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-11-20 07:14:26,689 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-20 07:14:26,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 68 [2021-11-20 07:14:26,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 07:14:26,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 07:14:26,698 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 07:14:26,698 INFO L388 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 68 treesize of output 59 [2021-11-20 07:14:26,711 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-20 07:14:26,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 52 [2021-11-20 07:14:27,619 INFO L354 Elim1Store]: treesize reduction 122, result has 8.3 percent of original size [2021-11-20 07:14:27,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 124 [2021-11-20 07:14:27,644 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-11-20 07:14:27,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 87 [2021-11-20 07:14:27,677 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-11-20 07:14:27,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 56 [2021-11-20 07:14:27,847 INFO L354 Elim1Store]: treesize reduction 29, result has 29.3 percent of original size [2021-11-20 07:14:27,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 61 [2021-11-20 07:14:27,861 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-11-20 07:14:27,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 38 [2021-11-20 07:14:28,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-20 07:14:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:14:28,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:14:30,774 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_10 Int) (|ULTIMATE.start_main_~data_new~0#1| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse3 (select (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_DerPreprocessor_9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse2 (select (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_DerPreprocessor_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_10)))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 |ULTIMATE.start_main_~data_new~0#1|))) .cse2) (+ .cse3 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (and (= .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2)))))) is different from false [2021-11-20 07:14:32,881 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_10 Int) (|ULTIMATE.start_main_~data_new~0#1| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_DerPreprocessor_9) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (select (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_DerPreprocessor_8) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_10)))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 |ULTIMATE.start_main_~data_new~0#1|))) .cse2) (+ .cse3 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (and (= .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse2)))))) is different from false [2021-11-20 07:14:34,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_10 Int) (|ULTIMATE.start_main_~data_new~0#1| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select (store (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_DerPreprocessor_11)))) (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_DerPreprocessor_8) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse4 (select (store (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_DerPreprocessor_12)))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_DerPreprocessor_9) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_sll_circular_create_~data#1|)))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_10))))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 |ULTIMATE.start_main_~data_new~0#1|))) .cse3) (+ .cse4 4))) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse3) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse4)))))) is different from false [2021-11-20 07:14:35,053 INFO L354 Elim1Store]: treesize reduction 73, result has 34.8 percent of original size [2021-11-20 07:14:35,054 INFO L388 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 3 case distinctions, treesize of input 267 treesize of output 237 [2021-11-20 07:14:35,066 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 07:14:35,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 333 treesize of output 279 [2021-11-20 07:14:35,146 INFO L354 Elim1Store]: treesize reduction 87, result has 34.1 percent of original size [2021-11-20 07:14:35,147 INFO L388 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 3 case distinctions, treesize of input 275 treesize of output 235 [2021-11-20 07:14:35,164 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 07:14:35,164 INFO L388 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 235 treesize of output 227 [2021-11-20 07:14:35,225 INFO L388 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 6 treesize of output 4 [2021-11-20 07:14:35,347 INFO L388 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 150 treesize of output 126 [2021-11-20 07:14:36,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 07:14:36,289 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 07:14:36,290 INFO L388 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 271 treesize of output 245