./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 21:01:26,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 21:01:26,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 21:01:26,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 21:01:26,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 21:01:26,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 21:01:26,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 21:01:26,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 21:01:26,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 21:01:26,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 21:01:26,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 21:01:26,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 21:01:26,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 21:01:26,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 21:01:26,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 21:01:26,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 21:01:26,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 21:01:26,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 21:01:26,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 21:01:26,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 21:01:26,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 21:01:26,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 21:01:26,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 21:01:26,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 21:01:26,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 21:01:26,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 21:01:26,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 21:01:26,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 21:01:26,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 21:01:26,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 21:01:26,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 21:01:26,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 21:01:26,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 21:01:26,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 21:01:26,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 21:01:26,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 21:01:26,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 21:01:26,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 21:01:26,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 21:01:26,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 21:01:26,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 21:01:26,124 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-06 21:01:26,141 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 21:01:26,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 21:01:26,141 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 21:01:26,142 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 21:01:26,142 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 21:01:26,142 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 21:01:26,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 21:01:26,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 21:01:26,143 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 21:01:26,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 21:01:26,143 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 21:01:26,143 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 21:01:26,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 21:01:26,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 21:01:26,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 21:01:26,144 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 21:01:26,144 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 21:01:26,144 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 21:01:26,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 21:01:26,144 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 21:01:26,144 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 21:01:26,144 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 21:01:26,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 21:01:26,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 21:01:26,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 21:01:26,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:01:26,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 21:01:26,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 21:01:26,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 21:01:26,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 21:01:26,145 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 21:01:26,145 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_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/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_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2021-12-06 21:01:26,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 21:01:26,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 21:01:26,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 21:01:26,336 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 21:01:26,336 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 21:01:26,337 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/list-simple/dll2n_update_all.i [2021-12-06 21:01:26,381 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/data/61ea9d6d0/34e0300187f9489998f24f1b2f3a5d09/FLAGded47a12b [2021-12-06 21:01:26,786 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 21:01:26,787 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/sv-benchmarks/c/list-simple/dll2n_update_all.i [2021-12-06 21:01:26,798 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/data/61ea9d6d0/34e0300187f9489998f24f1b2f3a5d09/FLAGded47a12b [2021-12-06 21:01:26,810 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/data/61ea9d6d0/34e0300187f9489998f24f1b2f3a5d09 [2021-12-06 21:01:26,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 21:01:26,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 21:01:26,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 21:01:26,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 21:01:26,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 21:01:26,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:01:26" (1/1) ... [2021-12-06 21:01:26,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1989aa80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:01:26, skipping insertion in model container [2021-12-06 21:01:26,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:01:26" (1/1) ... [2021-12-06 21:01:26,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 21:01:26,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 21:01:27,063 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_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2021-12-06 21:01:27,065 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:01:27,071 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 21:01:27,101 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_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2021-12-06 21:01:27,101 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:01:27,123 INFO L208 MainTranslator]: Completed translation [2021-12-06 21:01:27,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:01:27 WrapperNode [2021-12-06 21:01:27,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 21:01:27,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 21:01:27,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 21:01:27,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 21:01:27,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:01:27" (1/1) ... [2021-12-06 21:01:27,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:01:27" (1/1) ... [2021-12-06 21:01:27,158 INFO L137 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2021-12-06 21:01:27,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 21:01:27,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 21:01:27,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 21:01:27,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 21:01:27,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:01:27" (1/1) ... [2021-12-06 21:01:27,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:01:27" (1/1) ... [2021-12-06 21:01:27,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:01:27" (1/1) ... [2021-12-06 21:01:27,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:01:27" (1/1) ... [2021-12-06 21:01:27,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:01:27" (1/1) ... [2021-12-06 21:01:27,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:01:27" (1/1) ... [2021-12-06 21:01:27,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:01:27" (1/1) ... [2021-12-06 21:01:27,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 21:01:27,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 21:01:27,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 21:01:27,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 21:01:27,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:01:27" (1/1) ... [2021-12-06 21:01:27,189 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:01:27,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:01:27,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 21:01:27,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 21:01:27,238 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-06 21:01:27,238 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-06 21:01:27,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 21:01:27,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 21:01:27,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 21:01:27,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 21:01:27,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 21:01:27,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 21:01:27,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 21:01:27,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 21:01:27,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 21:01:27,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 21:01:27,316 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 21:01:27,317 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 21:01:27,334 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-06 21:01:27,493 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 21:01:27,498 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 21:01:27,498 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-06 21:01:27,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:01:27 BoogieIcfgContainer [2021-12-06 21:01:27,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 21:01:27,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 21:01:27,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 21:01:27,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 21:01:27,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 09:01:26" (1/3) ... [2021-12-06 21:01:27,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f0c5f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:01:27, skipping insertion in model container [2021-12-06 21:01:27,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:01:27" (2/3) ... [2021-12-06 21:01:27,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f0c5f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:01:27, skipping insertion in model container [2021-12-06 21:01:27,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:01:27" (3/3) ... [2021-12-06 21:01:27,505 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2021-12-06 21:01:27,509 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 21:01:27,509 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2021-12-06 21:01:27,541 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 21:01:27,546 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-12-06 21:01:27,546 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2021-12-06 21:01:27,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:27,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-06 21:01:27,562 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:27,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-06 21:01:27,563 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:27,567 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2021-12-06 21:01:27,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:27,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448599622] [2021-12-06 21:01:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:27,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:27,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:27,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448599622] [2021-12-06 21:01:27,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448599622] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:01:27,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:01:27,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 21:01:27,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182710309] [2021-12-06 21:01:27,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:01:27,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:01:27,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:27,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:01:27,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:01:27,760 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:27,830 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2021-12-06 21:01:27,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:01:27,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-06 21:01:27,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:27,838 INFO L225 Difference]: With dead ends: 111 [2021-12-06 21:01:27,838 INFO L226 Difference]: Without dead ends: 104 [2021-12-06 21:01:27,839 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-12-06 21:01:27,842 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:27,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:01:27,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-06 21:01:27,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2021-12-06 21:01:27,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2021-12-06 21:01:27,876 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2021-12-06 21:01:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:27,876 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2021-12-06 21:01:27,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2021-12-06 21:01:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-06 21:01:27,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:27,877 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-06 21:01:27,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 21:01:27,877 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:27,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:27,878 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2021-12-06 21:01:27,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:27,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905021168] [2021-12-06 21:01:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:27,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:27,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:27,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905021168] [2021-12-06 21:01:27,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905021168] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:01:27,915 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:01:27,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 21:01:27,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124786020] [2021-12-06 21:01:27,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:01:27,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:01:27,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:27,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:01:27,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:01:27,917 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:27,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:27,956 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2021-12-06 21:01:27,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:01:27,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-06 21:01:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:27,957 INFO L225 Difference]: With dead ends: 101 [2021-12-06 21:01:27,957 INFO L226 Difference]: Without dead ends: 101 [2021-12-06 21:01:27,958 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-12-06 21:01:27,959 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:27,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:01:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-06 21:01:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2021-12-06 21:01:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2021-12-06 21:01:27,965 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2021-12-06 21:01:27,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:27,965 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2021-12-06 21:01:27,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2021-12-06 21:01:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-06 21:01:27,965 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:27,965 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:27,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 21:01:27,966 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:27,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:27,966 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2021-12-06 21:01:27,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:27,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484351471] [2021-12-06 21:01:27,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:27,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:27,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:27,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484351471] [2021-12-06 21:01:27,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484351471] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:01:27,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:01:27,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 21:01:27,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038158885] [2021-12-06 21:01:27,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:01:27,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:01:27,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:27,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:01:27,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:01:27,990 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:27,998 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2021-12-06 21:01:27,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:01:27,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-06 21:01:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:27,999 INFO L225 Difference]: With dead ends: 66 [2021-12-06 21:01:27,999 INFO L226 Difference]: Without dead ends: 66 [2021-12-06 21:01:27,999 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-12-06 21:01:28,000 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:28,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:01:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-06 21:01:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2021-12-06 21:01:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2021-12-06 21:01:28,005 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2021-12-06 21:01:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:28,005 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2021-12-06 21:01:28,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2021-12-06 21:01:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 21:01:28,006 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:28,006 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:28,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 21:01:28,006 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:28,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2021-12-06 21:01:28,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:28,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219756389] [2021-12-06 21:01:28,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:28,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:28,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:28,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219756389] [2021-12-06 21:01:28,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219756389] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:01:28,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:01:28,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 21:01:28,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16755382] [2021-12-06 21:01:28,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:01:28,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:01:28,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:28,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:01:28,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:01:28,052 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:28,064 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2021-12-06 21:01:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:01:28,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-06 21:01:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:28,065 INFO L225 Difference]: With dead ends: 63 [2021-12-06 21:01:28,065 INFO L226 Difference]: Without dead ends: 63 [2021-12-06 21:01:28,065 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-12-06 21:01:28,066 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:28,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:01:28,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-06 21:01:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-12-06 21:01:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2021-12-06 21:01:28,071 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2021-12-06 21:01:28,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:28,071 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2021-12-06 21:01:28,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-12-06 21:01:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-06 21:01:28,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:28,072 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:28,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 21:01:28,072 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:28,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:28,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2021-12-06 21:01:28,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:28,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48497706] [2021-12-06 21:01:28,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:28,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:28,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:28,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48497706] [2021-12-06 21:01:28,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48497706] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:01:28,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358989885] [2021-12-06 21:01:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:28,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:28,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:01:28,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:01:28,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 21:01:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:28,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 21:01:28,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:01:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:28,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:01:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:28,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358989885] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:01:28,251 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:01:28,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-06 21:01:28,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580478054] [2021-12-06 21:01:28,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:01:28,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 21:01:28,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:28,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 21:01:28,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 21:01:28,252 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:28,264 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-12-06 21:01:28,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:01:28,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-06 21:01:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:28,265 INFO L225 Difference]: With dead ends: 64 [2021-12-06 21:01:28,265 INFO L226 Difference]: Without dead ends: 64 [2021-12-06 21:01:28,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 21:01:28,266 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:28,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:01:28,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-06 21:01:28,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-12-06 21:01:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2021-12-06 21:01:28,271 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2021-12-06 21:01:28,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:28,272 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2021-12-06 21:01:28,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2021-12-06 21:01:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 21:01:28,272 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:28,273 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:28,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 21:01:28,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:28,475 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:28,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2021-12-06 21:01:28,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:28,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905173723] [2021-12-06 21:01:28,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:28,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:28,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:28,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905173723] [2021-12-06 21:01:28,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905173723] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:01:28,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895871475] [2021-12-06 21:01:28,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:28,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:28,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:01:28,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:01:28,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 21:01:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:28,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 21:01:28,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:01:28,753 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-12-06 21:01:28,791 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 21:01:28,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-06 21:01:28,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:28,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:01:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:28,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895871475] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:01:28,921 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:01:28,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-06 21:01:28,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159755831] [2021-12-06 21:01:28,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:01:28,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:01:28,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:28,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:01:28,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:01:28,923 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:28,966 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2021-12-06 21:01:28,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:01:28,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-06 21:01:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:28,968 INFO L225 Difference]: With dead ends: 77 [2021-12-06 21:01:28,968 INFO L226 Difference]: Without dead ends: 77 [2021-12-06 21:01:28,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-06 21:01:28,969 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 266 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:28,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 66 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2021-12-06 21:01:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-06 21:01:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2021-12-06 21:01:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-12-06 21:01:28,973 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2021-12-06 21:01:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:28,974 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-12-06 21:01:28,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-12-06 21:01:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 21:01:28,974 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:28,974 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:28,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 21:01:29,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:29,176 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:29,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2021-12-06 21:01:29,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:29,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872314878] [2021-12-06 21:01:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:29,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:29,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:29,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872314878] [2021-12-06 21:01:29,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872314878] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:01:29,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515741314] [2021-12-06 21:01:29,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:29,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:29,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:01:29,376 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:01:29,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 21:01:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:29,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-06 21:01:29,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:01:29,430 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-12-06 21:01:29,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:01:29,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 21:01:29,480 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:01:29,480 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 11 treesize of output 11 [2021-12-06 21:01:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:29,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:01:29,645 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 36 treesize of output 32 [2021-12-06 21:01:29,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:29,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515741314] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:01:29,720 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:01:29,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-12-06 21:01:29,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528063767] [2021-12-06 21:01:29,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:01:29,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 21:01:29,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:29,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 21:01:29,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:01:29,721 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:29,797 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2021-12-06 21:01:29,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:01:29,797 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-06 21:01:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:29,798 INFO L225 Difference]: With dead ends: 76 [2021-12-06 21:01:29,798 INFO L226 Difference]: Without dead ends: 76 [2021-12-06 21:01:29,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-12-06 21:01:29,800 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 339 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:29,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 58 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 40 Unchecked, 0.0s Time] [2021-12-06 21:01:29,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-06 21:01:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2021-12-06 21:01:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2021-12-06 21:01:29,805 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2021-12-06 21:01:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:29,805 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2021-12-06 21:01:29,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-12-06 21:01:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 21:01:29,806 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:29,806 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:29,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-06 21:01:30,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-06 21:01:30,008 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:30,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:30,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2021-12-06 21:01:30,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:30,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482744139] [2021-12-06 21:01:30,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:30,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:30,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:30,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482744139] [2021-12-06 21:01:30,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482744139] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:01:30,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613202282] [2021-12-06 21:01:30,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:01:30,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:30,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:01:30,109 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:01:30,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 21:01:30,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-06 21:01:30,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:01:30,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 21:01:30,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:01:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:01:30,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:01:30,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613202282] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:01:30,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:01:30,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-06 21:01:30,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614154543] [2021-12-06 21:01:30,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:01:30,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 21:01:30,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:30,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 21:01:30,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:01:30,193 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:30,218 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2021-12-06 21:01:30,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 21:01:30,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-06 21:01:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:30,219 INFO L225 Difference]: With dead ends: 160 [2021-12-06 21:01:30,219 INFO L226 Difference]: Without dead ends: 160 [2021-12-06 21:01:30,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:01:30,220 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 113 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:30,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 212 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:01:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-06 21:01:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 64. [2021-12-06 21:01:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2021-12-06 21:01:30,225 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 22 [2021-12-06 21:01:30,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:30,225 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2021-12-06 21:01:30,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2021-12-06 21:01:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 21:01:30,226 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:30,226 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:30,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 21:01:30,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:30,427 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:30,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:30,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969322, now seen corresponding path program 1 times [2021-12-06 21:01:30,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:30,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197473972] [2021-12-06 21:01:30,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:30,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:30,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:30,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197473972] [2021-12-06 21:01:30,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197473972] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:01:30,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523684715] [2021-12-06 21:01:30,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:30,558 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:30,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:01:30,561 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:01:30,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 21:01:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:30,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 21:01:30,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:01:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:30,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:01:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:30,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523684715] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:01:30,688 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:01:30,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-12-06 21:01:30,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146420770] [2021-12-06 21:01:30,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:01:30,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 21:01:30,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:30,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 21:01:30,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 21:01:30,689 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:30,709 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-12-06 21:01:30,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:01:30,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-06 21:01:30,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:30,710 INFO L225 Difference]: With dead ends: 64 [2021-12-06 21:01:30,710 INFO L226 Difference]: Without dead ends: 64 [2021-12-06 21:01:30,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 21:01:30,711 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:30,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:01:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-06 21:01:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-12-06 21:01:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2021-12-06 21:01:30,716 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 22 [2021-12-06 21:01:30,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:30,717 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2021-12-06 21:01:30,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2021-12-06 21:01:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-06 21:01:30,718 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:30,718 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:30,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 21:01:30,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:30,919 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:30,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022437, now seen corresponding path program 1 times [2021-12-06 21:01:30,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:30,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533744507] [2021-12-06 21:01:30,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:30,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 21:01:31,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:31,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533744507] [2021-12-06 21:01:31,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533744507] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:01:31,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:01:31,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 21:01:31,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290418656] [2021-12-06 21:01:31,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:01:31,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:01:31,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:31,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:01:31,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:01:31,080 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:31,172 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2021-12-06 21:01:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:01:31,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-06 21:01:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:31,173 INFO L225 Difference]: With dead ends: 114 [2021-12-06 21:01:31,173 INFO L226 Difference]: Without dead ends: 114 [2021-12-06 21:01:31,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:01:31,175 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 259 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:31,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:01:31,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-06 21:01:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 67. [2021-12-06 21:01:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 66 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2021-12-06 21:01:31,180 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 23 [2021-12-06 21:01:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:31,180 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2021-12-06 21:01:31,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2021-12-06 21:01:31,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-06 21:01:31,181 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:31,181 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:31,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 21:01:31,181 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:31,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:31,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022436, now seen corresponding path program 1 times [2021-12-06 21:01:31,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:31,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140282989] [2021-12-06 21:01:31,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:31,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:01:31,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:31,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140282989] [2021-12-06 21:01:31,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140282989] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:01:31,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:01:31,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 21:01:31,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176335285] [2021-12-06 21:01:31,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:01:31,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:01:31,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:31,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:01:31,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:01:31,257 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:31,360 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2021-12-06 21:01:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:01:31,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-06 21:01:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:31,361 INFO L225 Difference]: With dead ends: 102 [2021-12-06 21:01:31,361 INFO L226 Difference]: Without dead ends: 102 [2021-12-06 21:01:31,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:01:31,362 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:31,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:01:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-06 21:01:31,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 67. [2021-12-06 21:01:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2021-12-06 21:01:31,366 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 23 [2021-12-06 21:01:31,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:31,367 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2021-12-06 21:01:31,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,367 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2021-12-06 21:01:31,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-06 21:01:31,368 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:31,368 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:31,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 21:01:31,368 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:31,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:31,369 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2021-12-06 21:01:31,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:31,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584423031] [2021-12-06 21:01:31,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:31,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:01:31,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:31,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584423031] [2021-12-06 21:01:31,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584423031] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:01:31,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:01:31,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 21:01:31,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815782990] [2021-12-06 21:01:31,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:01:31,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 21:01:31,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:31,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 21:01:31,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 21:01:31,415 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:31,427 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2021-12-06 21:01:31,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:01:31,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-06 21:01:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:31,428 INFO L225 Difference]: With dead ends: 85 [2021-12-06 21:01:31,428 INFO L226 Difference]: Without dead ends: 85 [2021-12-06 21:01:31,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 21:01:31,429 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 85 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:31,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 105 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:01:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-06 21:01:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2021-12-06 21:01:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.3962264150943395) 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-12-06 21:01:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2021-12-06 21:01:31,433 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 25 [2021-12-06 21:01:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:31,433 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2021-12-06 21:01:31,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2021-12-06 21:01:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 21:01:31,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:31,435 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:31,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 21:01:31,435 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:31,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1962551635, now seen corresponding path program 1 times [2021-12-06 21:01:31,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:31,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791725152] [2021-12-06 21:01:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:31,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 21:01:31,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:31,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791725152] [2021-12-06 21:01:31,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791725152] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:01:31,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:01:31,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 21:01:31,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166202735] [2021-12-06 21:01:31,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:01:31,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:01:31,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:31,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:01:31,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:01:31,490 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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-12-06 21:01:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:31,570 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2021-12-06 21:01:31,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:01:31,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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 30 [2021-12-06 21:01:31,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:31,571 INFO L225 Difference]: With dead ends: 87 [2021-12-06 21:01:31,571 INFO L226 Difference]: Without dead ends: 87 [2021-12-06 21:01:31,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:01:31,571 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 238 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:31,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 95 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:01:31,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-06 21:01:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2021-12-06 21:01:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-06 21:01:31,574 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 30 [2021-12-06 21:01:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:31,574 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-06 21:01:31,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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-12-06 21:01:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-06 21:01:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 21:01:31,575 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:31,575 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:31,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 21:01:31,575 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:31,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1962551634, now seen corresponding path program 1 times [2021-12-06 21:01:31,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:31,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885401889] [2021-12-06 21:01:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:31,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 21:01:31,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:31,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885401889] [2021-12-06 21:01:31,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885401889] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:01:31,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:01:31,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 21:01:31,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749919551] [2021-12-06 21:01:31,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:01:31,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:01:31,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:31,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:01:31,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:01:31,639 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:31,745 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2021-12-06 21:01:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:01:31,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-06 21:01:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:31,746 INFO L225 Difference]: With dead ends: 94 [2021-12-06 21:01:31,746 INFO L226 Difference]: Without dead ends: 94 [2021-12-06 21:01:31,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:01:31,747 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 324 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:31,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 75 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:01:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-06 21:01:31,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2021-12-06 21:01:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2021-12-06 21:01:31,749 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 30 [2021-12-06 21:01:31,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:31,749 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2021-12-06 21:01:31,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2021-12-06 21:01:31,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 21:01:31,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:31,750 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:31,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 21:01:31,750 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:31,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:31,751 INFO L85 PathProgramCache]: Analyzing trace with hash -669697558, now seen corresponding path program 1 times [2021-12-06 21:01:31,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:31,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248691762] [2021-12-06 21:01:31,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:31,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:01:31,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:31,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248691762] [2021-12-06 21:01:31,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248691762] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:01:31,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839923981] [2021-12-06 21:01:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:31,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:31,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:01:31,793 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:01:31,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 21:01:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:31,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 21:01:31,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:01:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:01:31,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:01:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:01:31,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839923981] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:01:31,926 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:01:31,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2021-12-06 21:01:31,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092947643] [2021-12-06 21:01:31,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:01:31,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:01:31,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:31,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:01:31,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:01:31,927 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:31,961 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2021-12-06 21:01:31,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:01:31,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-06 21:01:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:31,963 INFO L225 Difference]: With dead ends: 136 [2021-12-06 21:01:31,963 INFO L226 Difference]: Without dead ends: 136 [2021-12-06 21:01:31,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:01:31,964 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 167 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:31,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 184 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:01:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-06 21:01:31,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 79. [2021-12-06 21:01:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.375) internal successors, (88), 78 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2021-12-06 21:01:31,967 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 31 [2021-12-06 21:01:31,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:31,967 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2021-12-06 21:01:31,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:31,967 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2021-12-06 21:01:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 21:01:31,968 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:31,968 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:32,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 21:01:32,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-06 21:01:32,169 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:32,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:32,170 INFO L85 PathProgramCache]: Analyzing trace with hash -669697613, now seen corresponding path program 1 times [2021-12-06 21:01:32,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:32,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688179064] [2021-12-06 21:01:32,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:32,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:01:32,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:32,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688179064] [2021-12-06 21:01:32,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688179064] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:01:32,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421194162] [2021-12-06 21:01:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:32,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:32,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:01:32,331 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:01:32,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 21:01:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:32,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-06 21:01:32,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:01:32,416 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-12-06 21:01:32,440 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:01:32,441 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 11 treesize of output 11 [2021-12-06 21:01:32,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:01:32,504 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-06 21:01:32,505 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 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 21:01:32,523 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:01:32,523 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-06 21:01:32,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:01:32,624 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 33 treesize of output 26 [2021-12-06 21:01:32,660 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 31 treesize of output 13 [2021-12-06 21:01:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:01:32,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:01:38,945 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-06 21:01:38,945 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 21 treesize of output 20 [2021-12-06 21:01:38,949 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_845) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) is different from false [2021-12-06 21:01:38,957 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_843 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_843)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_845) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) is different from false [2021-12-06 21:01:38,968 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-06 21:01:38,968 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 2 case distinctions, treesize of input 27 treesize of output 33 [2021-12-06 21:01:38,971 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 36 treesize of output 24 [2021-12-06 21:01:38,973 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 7 treesize of output 3 [2021-12-06 21:01:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2021-12-06 21:01:39,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421194162] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:01:39,008 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:01:39,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 32 [2021-12-06 21:01:39,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447653369] [2021-12-06 21:01:39,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:01:39,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-06 21:01:39,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:39,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-06 21:01:39,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=844, Unknown=3, NotChecked=118, Total=1056 [2021-12-06 21:01:39,009 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:39,817 INFO L93 Difference]: Finished difference Result 217 states and 242 transitions. [2021-12-06 21:01:39,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 21:01:39,818 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-06 21:01:39,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:39,819 INFO L225 Difference]: With dead ends: 217 [2021-12-06 21:01:39,820 INFO L226 Difference]: Without dead ends: 217 [2021-12-06 21:01:39,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=330, Invalid=1931, Unknown=3, NotChecked=186, Total=2450 [2021-12-06 21:01:39,821 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 934 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 313 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:39,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [934 Valid, 838 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 827 Invalid, 0 Unknown, 313 Unchecked, 0.3s Time] [2021-12-06 21:01:39,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-06 21:01:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 109. [2021-12-06 21:01:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 108 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2021-12-06 21:01:39,828 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 31 [2021-12-06 21:01:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:39,828 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2021-12-06 21:01:39,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2021-12-06 21:01:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 21:01:39,829 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:39,829 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:39,848 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 21:01:40,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-06 21:01:40,030 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:40,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:40,030 INFO L85 PathProgramCache]: Analyzing trace with hash -669697612, now seen corresponding path program 1 times [2021-12-06 21:01:40,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:40,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634847437] [2021-12-06 21:01:40,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:40,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:01:40,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:40,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634847437] [2021-12-06 21:01:40,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634847437] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:01:40,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029817125] [2021-12-06 21:01:40,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:40,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:40,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:01:40,250 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:01:40,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 21:01:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:40,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-06 21:01:40,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:01:40,327 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-12-06 21:01:40,382 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:01:40,382 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 11 treesize of output 11 [2021-12-06 21:01:40,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:01:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:01:40,454 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-06 21:01:40,455 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 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 21:01:40,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:01:40,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 21:01:40,486 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:01:40,486 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2021-12-06 21:01:40,490 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 41 treesize of output 41 [2021-12-06 21:01:40,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:01:40,664 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 41 treesize of output 34 [2021-12-06 21:01:40,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:01:40,668 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 40 treesize of output 33 [2021-12-06 21:01:40,726 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 39 treesize of output 21 [2021-12-06 21:01:40,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2021-12-06 21:01:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:01:40,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:01:43,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse0))))) (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) is different from false [2021-12-06 21:01:45,047 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (<= (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse0)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse0)))))))) is different from false [2021-12-06 21:01:47,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse0))))) (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) is different from false [2021-12-06 21:01:49,112 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse0)))))))) is different from false [2021-12-06 21:01:49,130 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:01:49,131 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 55 treesize of output 59 [2021-12-06 21:01:49,189 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_prenex_2 Int) (v_ArrVal_961 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_prenex_2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_964 Int) (v_ArrVal_961 (Array Int Int))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (forall ((v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) is different from false [2021-12-06 21:01:49,258 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_ArrVal_959 Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_959)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_960 Int) (v_ArrVal_964 Int) (v_ArrVal_961 (Array Int Int))) (<= (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_960)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (forall ((v_ArrVal_960 Int) (v_prenex_2 Int) (v_ArrVal_961 (Array Int Int))) (<= 0 (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_960)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_prenex_2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))))) is different from false [2021-12-06 21:01:49,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:01:49,276 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:01:49,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 104 [2021-12-06 21:01:49,279 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 123 treesize of output 117 [2021-12-06 21:01:49,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:01:49,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:01:49,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2021-12-06 21:01:49,286 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 119 treesize of output 113 [2021-12-06 21:01:49,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:01:49,290 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:01:49,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 98 [2021-12-06 21:01:49,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:01:49,297 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:01:49,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 103 [2021-12-06 21:01:49,301 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 120 treesize of output 114 [2021-12-06 21:01:49,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:01:49,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:01:49,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 99 [2021-12-06 21:01:49,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:01:49,312 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 53 treesize of output 49 [2021-12-06 21:01:49,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:01:49,315 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 46 treesize of output 42 [2021-12-06 21:01:49,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:01:49,318 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 39 treesize of output 35 [2021-12-06 21:01:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-06 21:01:49,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029817125] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:01:49,462 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:01:49,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 39 [2021-12-06 21:01:49,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241808635] [2021-12-06 21:01:49,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:01:49,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-06 21:01:49,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:49,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-06 21:01:49,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1035, Unknown=6, NotChecked=414, Total=1560 [2021-12-06 21:01:49,465 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:51,707 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_prenex_2 Int) (v_ArrVal_961 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_prenex_2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_964 Int) (v_ArrVal_961 (Array Int Int))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (forall ((v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))) is different from false [2021-12-06 21:01:52,413 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_prenex_2 Int) (v_ArrVal_961 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_prenex_2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_964 Int) (v_ArrVal_961 (Array Int Int))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (forall ((v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))) is different from false [2021-12-06 21:01:53,000 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse2 (select |c_#length| .cse1))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= 12 .cse2) (<= 0 .cse0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse3) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse3)))))))) (<= (+ .cse0 12) .cse2))))) is different from false [2021-12-06 21:01:53,585 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse2 (select .cse0 .cse5)) (.cse1 (select .cse4 .cse5))) (and (= (select |c_#length| (select .cse0 4)) 12) (<= (+ 12 .cse1) (select |c_#length| .cse2)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse3) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse3))))) (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2)) (<= 0 .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select .cse4 4) 0)))) is different from false [2021-12-06 21:01:54,173 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse2 .cse5)) (.cse3 (select .cse0 .cse5))) (and (= (select .cse0 4) 0) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| .cse1)) (= 12 (select |c_#length| (select .cse2 4))) (<= (+ .cse3 12) (select |c_#length| .cse1)) (<= 0 .cse3) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (<= (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse4)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse4))))))))))) is different from false [2021-12-06 21:01:54,763 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select .cse3 .cse5)) (.cse4 (select .cse1 .cse5))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse0))))) (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (= (select |c_#length| (select .cse1 4)) 12) (<= 0 .cse2) (= 0 (select .cse3 4)) (not (= .cse4 |c_ULTIMATE.start_main_~s~0#1.base|)) (<= (+ 12 .cse2) (select |c_#length| .cse4)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 21:01:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:55,471 INFO L93 Difference]: Finished difference Result 269 states and 302 transitions. [2021-12-06 21:01:55,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 21:01:55,472 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-06 21:01:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:55,473 INFO L225 Difference]: With dead ends: 269 [2021-12-06 21:01:55,473 INFO L226 Difference]: Without dead ends: 269 [2021-12-06 21:01:55,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=230, Invalid=1698, Unknown=12, NotChecked=1140, Total=3080 [2021-12-06 21:01:55,474 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 721 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1405 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:55,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 2095 Invalid, 2891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1456 Invalid, 0 Unknown, 1405 Unchecked, 0.6s Time] [2021-12-06 21:01:55,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-12-06 21:01:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 117. [2021-12-06 21:01:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 116 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2021-12-06 21:01:55,478 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 31 [2021-12-06 21:01:55,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:55,478 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2021-12-06 21:01:55,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:55,478 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2021-12-06 21:01:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-06 21:01:55,479 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:55,479 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:55,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 21:01:55,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 21:01:55,681 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:55,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:55,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1015753968, now seen corresponding path program 1 times [2021-12-06 21:01:55,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:55,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102562734] [2021-12-06 21:01:55,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:55,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 21:01:55,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:55,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102562734] [2021-12-06 21:01:55,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102562734] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:01:55,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:01:55,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 21:01:55,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765029905] [2021-12-06 21:01:55,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:01:55,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 21:01:55,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:55,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 21:01:55,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 21:01:55,723 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:55,738 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2021-12-06 21:01:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 21:01:55,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-06 21:01:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:55,739 INFO L225 Difference]: With dead ends: 141 [2021-12-06 21:01:55,739 INFO L226 Difference]: Without dead ends: 141 [2021-12-06 21:01:55,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 21:01:55,739 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:55,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 161 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:01:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-06 21:01:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2021-12-06 21:01:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 117 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2021-12-06 21:01:55,742 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 33 [2021-12-06 21:01:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:55,743 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2021-12-06 21:01:55,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2021-12-06 21:01:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 21:01:55,743 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:55,743 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:55,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 21:01:55,743 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:55,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:55,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1373031599, now seen corresponding path program 1 times [2021-12-06 21:01:55,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:55,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606755265] [2021-12-06 21:01:55,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:55,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:01:55,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:55,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606755265] [2021-12-06 21:01:55,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606755265] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:01:55,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446888704] [2021-12-06 21:01:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:55,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:55,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:01:55,801 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:01:55,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 21:01:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:55,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 21:01:55,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:01:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:01:55,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:01:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:01:55,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446888704] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:01:55,963 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:01:55,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-12-06 21:01:55,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290221532] [2021-12-06 21:01:55,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:01:55,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:01:55,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:55,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:01:55,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:01:55,965 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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-12-06 21:01:55,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:55,986 INFO L93 Difference]: Finished difference Result 126 states and 144 transitions. [2021-12-06 21:01:55,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 21:01:55,986 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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) Word has length 34 [2021-12-06 21:01:55,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:55,987 INFO L225 Difference]: With dead ends: 126 [2021-12-06 21:01:55,987 INFO L226 Difference]: Without dead ends: 126 [2021-12-06 21:01:55,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:01:55,988 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 148 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:55,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 182 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:01:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-06 21:01:55,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2021-12-06 21:01:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 109 states have (on average 1.311926605504587) internal successors, (143), 123 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2021-12-06 21:01:55,992 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 34 [2021-12-06 21:01:55,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:55,992 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2021-12-06 21:01:55,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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-12-06 21:01:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2021-12-06 21:01:55,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-06 21:01:55,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:55,993 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:56,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 21:01:56,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:56,194 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:56,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:56,194 INFO L85 PathProgramCache]: Analyzing trace with hash -833185593, now seen corresponding path program 2 times [2021-12-06 21:01:56,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:56,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814417891] [2021-12-06 21:01:56,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:56,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 21:01:56,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:56,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814417891] [2021-12-06 21:01:56,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814417891] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:01:56,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800163920] [2021-12-06 21:01:56,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:01:56,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:56,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:01:56,242 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:01:56,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 21:01:56,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 21:01:56,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:01:56,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 21:01:56,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:01:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 21:01:56,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:01:56,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800163920] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:01:56,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:01:56,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-12-06 21:01:56,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123199234] [2021-12-06 21:01:56,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:01:56,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 21:01:56,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:56,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 21:01:56,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:01:56,378 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:56,385 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2021-12-06 21:01:56,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 21:01:56,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-06 21:01:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:56,386 INFO L225 Difference]: With dead ends: 104 [2021-12-06 21:01:56,386 INFO L226 Difference]: Without dead ends: 104 [2021-12-06 21:01:56,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:01:56,387 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 100 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:56,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 78 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:01:56,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-06 21:01:56,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-06 21:01:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.348314606741573) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2021-12-06 21:01:56,389 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 39 [2021-12-06 21:01:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:56,389 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2021-12-06 21:01:56,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2021-12-06 21:01:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-06 21:01:56,390 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:56,390 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:56,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 21:01:56,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:56,591 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:56,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:56,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1013618178, now seen corresponding path program 2 times [2021-12-06 21:01:56,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:56,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071301669] [2021-12-06 21:01:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:56,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 21:01:56,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:56,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071301669] [2021-12-06 21:01:56,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071301669] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:01:56,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920239491] [2021-12-06 21:01:56,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:01:56,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:56,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:01:56,675 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:01:56,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 21:01:56,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 21:01:56,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:01:56,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 21:01:56,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:01:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 21:01:56,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:01:56,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920239491] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:01:56,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:01:56,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-12-06 21:01:56,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993741058] [2021-12-06 21:01:56,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:01:56,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:01:56,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:56,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:01:56,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:01:56,878 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:56,893 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2021-12-06 21:01:56,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:01:56,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-06 21:01:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:56,894 INFO L225 Difference]: With dead ends: 82 [2021-12-06 21:01:56,894 INFO L226 Difference]: Without dead ends: 82 [2021-12-06 21:01:56,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:01:56,894 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 65 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:56,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 115 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:01:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-06 21:01:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2021-12-06 21:01:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2021-12-06 21:01:56,897 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 39 [2021-12-06 21:01:56,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:56,898 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2021-12-06 21:01:56,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2021-12-06 21:01:56,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-06 21:01:56,898 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:56,898 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:56,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 21:01:57,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:57,100 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:57,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:57,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1273435421, now seen corresponding path program 2 times [2021-12-06 21:01:57,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:57,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632691774] [2021-12-06 21:01:57,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:57,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:01:57,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:57,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632691774] [2021-12-06 21:01:57,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632691774] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:01:57,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270689613] [2021-12-06 21:01:57,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:01:57,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:57,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:01:57,264 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:01:57,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 21:01:57,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 21:01:57,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:01:57,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 21:01:57,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:01:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:01:57,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:01:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:01:57,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270689613] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:01:57,603 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:01:57,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2021-12-06 21:01:57,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427920115] [2021-12-06 21:01:57,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:01:57,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:01:57,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:57,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:01:57,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:01:57,604 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-06 21:01:57,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:01:57,620 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2021-12-06 21:01:57,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 21:01:57,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-06 21:01:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:01:57,621 INFO L225 Difference]: With dead ends: 78 [2021-12-06 21:01:57,621 INFO L226 Difference]: Without dead ends: 78 [2021-12-06 21:01:57,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:01:57,621 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 80 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:01:57,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 180 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:01:57,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-06 21:01:57,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2021-12-06 21:01:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:01:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2021-12-06 21:01:57,623 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 39 [2021-12-06 21:01:57,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:01:57,623 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2021-12-06 21:01:57,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-06 21:01:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2021-12-06 21:01:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-06 21:01:57,624 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:01:57,624 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:01:57,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 21:01:57,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-06 21:01:57,826 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:01:57,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:01:57,827 INFO L85 PathProgramCache]: Analyzing trace with hash 993974679, now seen corresponding path program 1 times [2021-12-06 21:01:57,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:01:57,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463934966] [2021-12-06 21:01:57,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:57,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:01:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:58,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:01:58,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463934966] [2021-12-06 21:01:58,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463934966] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:01:58,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187075599] [2021-12-06 21:01:58,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:01:58,194 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:01:58,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:01:58,195 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:01:58,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 21:01:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:01:58,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 86 conjunts are in the unsatisfiable core [2021-12-06 21:01:58,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:01:58,302 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-12-06 21:01:58,346 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:01:58,346 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 11 treesize of output 11 [2021-12-06 21:01:58,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:01:58,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:01:58,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 21:01:58,421 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:01:58,422 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-06 21:01:58,563 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 20 treesize of output 19 [2021-12-06 21:01:58,567 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-12-06 21:01:58,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:01:58,654 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2021-12-06 21:01:58,715 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 14 treesize of output 16 [2021-12-06 21:01:58,804 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-12-06 21:01:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:01:58,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:01:58,942 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1639 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1639 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-06 21:01:58,953 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1639 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1639 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-06 21:01:58,960 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1639 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1639 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-06 21:01:58,972 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1639 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1639 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2021-12-06 21:01:58,988 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:01:58,989 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 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-06 21:01:58,994 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:01:58,994 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 58 treesize of output 61 [2021-12-06 21:01:58,997 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 23 treesize of output 21 [2021-12-06 21:01:59,027 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:01:59,027 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 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-06 21:01:59,030 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2021-12-06 21:01:59,033 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 23 treesize of output 21 [2021-12-06 21:01:59,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1636 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1633) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_ArrVal_1636) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2021-12-06 21:01:59,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1631 Int) (v_ArrVal_1636 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1631)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1633) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_ArrVal_1636) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2021-12-06 21:01:59,215 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-06 21:01:59,216 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 2 case distinctions, treesize of input 31 treesize of output 37 [2021-12-06 21:01:59,218 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 45 treesize of output 41 [2021-12-06 21:01:59,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:01:59,220 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 29 treesize of output 25 [2021-12-06 21:01:59,222 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 49 treesize of output 41 [2021-12-06 21:01:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-06 21:01:59,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187075599] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:01:59,303 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:01:59,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 58 [2021-12-06 21:01:59,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295947143] [2021-12-06 21:01:59,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:01:59,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-12-06 21:01:59,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:01:59,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-12-06 21:01:59,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2465, Unknown=6, NotChecked=630, Total=3306 [2021-12-06 21:01:59,306 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:02:00,208 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2021-12-06 21:02:00,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 21:02:00,208 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-06 21:02:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:02:00,208 INFO L225 Difference]: With dead ends: 76 [2021-12-06 21:02:00,208 INFO L226 Difference]: Without dead ends: 76 [2021-12-06 21:02:00,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=503, Invalid=4484, Unknown=7, NotChecked=858, Total=5852 [2021-12-06 21:02:00,210 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 151 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 572 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 21:02:00,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 1015 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 833 Invalid, 0 Unknown, 572 Unchecked, 0.3s Time] [2021-12-06 21:02:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-06 21:02:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-06 21:02:00,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2) internal successors, (78), 75 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2021-12-06 21:02:00,212 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 42 [2021-12-06 21:02:00,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:02:00,212 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2021-12-06 21:02:00,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2021-12-06 21:02:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-06 21:02:00,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:02:00,213 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:02:00,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-06 21:02:00,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-06 21:02:00,415 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:02:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:02:00,416 INFO L85 PathProgramCache]: Analyzing trace with hash 594303695, now seen corresponding path program 1 times [2021-12-06 21:02:00,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:02:00,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124110522] [2021-12-06 21:02:00,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:00,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:02:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 21:02:00,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:02:00,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124110522] [2021-12-06 21:02:00,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124110522] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:02:00,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664178595] [2021-12-06 21:02:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:00,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:02:00,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:02:00,665 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:02:00,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 21:02:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:00,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-06 21:02:00,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:02:00,762 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-12-06 21:02:00,783 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:02:00,784 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 11 treesize of output 11 [2021-12-06 21:02:00,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:02:00,822 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-06 21:02:00,822 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 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 21:02:00,835 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:02:00,835 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-06 21:02:00,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:02:00,907 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 22 treesize of output 21 [2021-12-06 21:02:00,979 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:02:00,979 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-06 21:02:01,047 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 31 treesize of output 13 [2021-12-06 21:02:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 21:02:01,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:02:01,101 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-06 21:02:01,101 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 21 treesize of output 20 [2021-12-06 21:02:01,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) is different from false [2021-12-06 21:02:01,110 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base|)) is different from false [2021-12-06 21:02:01,115 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2021-12-06 21:02:01,122 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)))) is different from false [2021-12-06 21:02:01,132 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1764 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1764))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) is different from false [2021-12-06 21:02:01,147 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) is different from false [2021-12-06 21:02:01,159 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2) .cse1))))) is different from false [2021-12-06 21:02:01,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2021-12-06 21:02:01,189 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)))))) is different from false [2021-12-06 21:02:01,201 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1761 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1761))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2021-12-06 21:02:01,221 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1760 Int) (v_ArrVal_1761 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1760)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1761))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2021-12-06 21:02:01,227 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:01,230 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:01,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 71 [2021-12-06 21:02:01,234 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 100 treesize of output 92 [2021-12-06 21:02:01,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:01,238 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 24 treesize of output 16 [2021-12-06 21:02:01,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:01,241 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 22 [2021-12-06 21:02:01,244 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 7 treesize of output 3 [2021-12-06 21:02:01,285 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 13 not checked. [2021-12-06 21:02:01,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664178595] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:02:01,285 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:02:01,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 46 [2021-12-06 21:02:01,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922718252] [2021-12-06 21:02:01,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:02:01,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-06 21:02:01,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:02:01,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-06 21:02:01,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1163, Unknown=11, NotChecked=858, Total=2162 [2021-12-06 21:02:01,287 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 47 states, 46 states have (on average 2.869565217391304) internal successors, (132), 47 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:01,438 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1761 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1761))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse3 .cse4))) (= .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) .cse1 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))))) is different from false [2021-12-06 21:02:01,441 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1761 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1761))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse3 .cse4))) (= .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) .cse1 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))))) is different from false [2021-12-06 21:02:01,443 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))))))) is different from false [2021-12-06 21:02:01,446 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|)))) is different from false [2021-12-06 21:02:01,448 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2) .cse1))))) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0)) is different from false [2021-12-06 21:02:01,451 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)) is different from false [2021-12-06 21:02:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:02:01,836 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2021-12-06 21:02:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 21:02:01,837 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.869565217391304) internal successors, (132), 47 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-06 21:02:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:02:01,837 INFO L225 Difference]: With dead ends: 118 [2021-12-06 21:02:01,837 INFO L226 Difference]: Without dead ends: 118 [2021-12-06 21:02:01,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=1858, Unknown=17, NotChecked=1768, Total=3906 [2021-12-06 21:02:01,839 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 372 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 949 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:02:01,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 605 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 594 Invalid, 0 Unknown, 949 Unchecked, 0.2s Time] [2021-12-06 21:02:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-06 21:02:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2021-12-06 21:02:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2021-12-06 21:02:01,841 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 48 [2021-12-06 21:02:01,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:02:01,841 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2021-12-06 21:02:01,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.869565217391304) internal successors, (132), 47 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2021-12-06 21:02:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-06 21:02:01,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:02:01,841 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:02:01,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-06 21:02:02,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-06 21:02:02,043 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:02:02,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:02:02,045 INFO L85 PathProgramCache]: Analyzing trace with hash 594303696, now seen corresponding path program 1 times [2021-12-06 21:02:02,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:02:02,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284723623] [2021-12-06 21:02:02,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:02,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:02:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 21:02:02,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:02:02,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284723623] [2021-12-06 21:02:02,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284723623] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:02:02,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528617082] [2021-12-06 21:02:02,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:02,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:02:02,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:02:02,436 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:02:02,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 21:02:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:02,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-06 21:02:02,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:02:02,545 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-12-06 21:02:02,576 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:02:02,576 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 11 treesize of output 11 [2021-12-06 21:02:02,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:02:02,621 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-06 21:02:02,621 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 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 21:02:02,633 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:02:02,634 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-06 21:02:02,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:02:02,731 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 22 treesize of output 21 [2021-12-06 21:02:02,820 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:02:02,821 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2021-12-06 21:02:02,823 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 41 treesize of output 41 [2021-12-06 21:02:02,937 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 39 treesize of output 21 [2021-12-06 21:02:02,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2021-12-06 21:02:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 21:02:02,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:02:03,087 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:03,087 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 46 treesize of output 50 [2021-12-06 21:02:03,235 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:03,235 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 123 treesize of output 108 [2021-12-06 21:02:03,238 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 89 treesize of output 85 [2021-12-06 21:02:03,241 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 85 treesize of output 81 [2021-12-06 21:02:03,757 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-06 21:02:04,167 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))))) is different from false [2021-12-06 21:02:04,578 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))) is different from false [2021-12-06 21:02:04,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2021-12-06 21:02:05,001 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1890 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2021-12-06 21:02:05,019 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1890 Int) (v_ArrVal_1885 Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1885)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2021-12-06 21:02:05,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:05,028 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:05,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2021-12-06 21:02:05,032 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 45 treesize of output 41 [2021-12-06 21:02:05,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:05,038 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 38 treesize of output 30 [2021-12-06 21:02:05,040 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:05,042 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 8 treesize of output 4 [2021-12-06 21:02:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-12-06 21:02:05,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528617082] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:02:05,099 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:02:05,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 47 [2021-12-06 21:02:05,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412037680] [2021-12-06 21:02:05,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:02:05,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-06 21:02:05,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:02:05,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-06 21:02:05,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1596, Unknown=6, NotChecked=510, Total=2256 [2021-12-06 21:02:05,101 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 48 states, 47 states have (on average 2.7872340425531914) internal successors, (131), 48 states have internal predecessors, (131), 0 states have call successors, (0), 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-12-06 21:02:05,760 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|)))))) is different from false [2021-12-06 21:02:06,183 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (select |c_#length| .cse0) 12) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) is different from false [2021-12-06 21:02:06,602 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (select |c_#length| .cse0) 12) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) is different from false [2021-12-06 21:02:07,022 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= 12 (select |c_#length| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))))) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2021-12-06 21:02:07,436 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#length| .cse0) 12) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 21:02:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:02:08,099 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2021-12-06 21:02:08,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 21:02:08,100 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.7872340425531914) internal successors, (131), 48 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-06 21:02:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:02:08,100 INFO L225 Difference]: With dead ends: 125 [2021-12-06 21:02:08,100 INFO L226 Difference]: Without dead ends: 125 [2021-12-06 21:02:08,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 71 SyntacticMatches, 10 SemanticMatches, 63 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=313, Invalid=2582, Unknown=11, NotChecked=1254, Total=4160 [2021-12-06 21:02:08,102 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 545 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 577 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 21:02:08,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 1315 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 752 Invalid, 0 Unknown, 577 Unchecked, 0.3s Time] [2021-12-06 21:02:08,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-06 21:02:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 79. [2021-12-06 21:02:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2021-12-06 21:02:08,104 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 48 [2021-12-06 21:02:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:02:08,104 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2021-12-06 21:02:08,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.7872340425531914) internal successors, (131), 48 states have internal predecessors, (131), 0 states have call successors, (0), 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-12-06 21:02:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2021-12-06 21:02:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-06 21:02:08,105 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:02:08,105 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:02:08,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-06 21:02:08,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-06 21:02:08,307 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:02:08,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:02:08,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1192975024, now seen corresponding path program 1 times [2021-12-06 21:02:08,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:02:08,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326567147] [2021-12-06 21:02:08,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:08,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:02:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 21:02:08,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:02:08,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326567147] [2021-12-06 21:02:08,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326567147] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:02:08,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398813169] [2021-12-06 21:02:08,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:08,394 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:02:08,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:02:08,394 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:02:08,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-06 21:02:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:08,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 21:02:08,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:02:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 21:02:08,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:02:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 21:02:08,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398813169] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:02:08,590 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:02:08,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2021-12-06 21:02:08,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912364336] [2021-12-06 21:02:08,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:02:08,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:02:08,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:02:08,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:02:08,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:02:08,591 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:02:08,613 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2021-12-06 21:02:08,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 21:02:08,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-12-06 21:02:08,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:02:08,614 INFO L225 Difference]: With dead ends: 79 [2021-12-06 21:02:08,614 INFO L226 Difference]: Without dead ends: 79 [2021-12-06 21:02:08,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:02:08,614 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 84 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:02:08,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 160 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:02:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-06 21:02:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-12-06 21:02:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 78 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2021-12-06 21:02:08,617 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 49 [2021-12-06 21:02:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:02:08,617 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2021-12-06 21:02:08,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2021-12-06 21:02:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-06 21:02:08,617 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:02:08,617 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:02:08,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-06 21:02:08,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-06 21:02:08,819 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:02:08,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:02:08,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1047895438, now seen corresponding path program 2 times [2021-12-06 21:02:08,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:02:08,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544801961] [2021-12-06 21:02:08,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:08,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:02:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:08,901 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 21:02:08,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:02:08,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544801961] [2021-12-06 21:02:08,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544801961] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:02:08,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122791845] [2021-12-06 21:02:08,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:02:08,902 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:02:08,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:02:08,902 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:02:08,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-06 21:02:09,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 21:02:09,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:02:09,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 21:02:09,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:02:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 21:02:09,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:02:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 21:02:09,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122791845] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:02:09,147 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:02:09,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-12-06 21:02:09,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64591938] [2021-12-06 21:02:09,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:02:09,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:02:09,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:02:09,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:02:09,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:02:09,149 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:02:09,188 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2021-12-06 21:02:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 21:02:09,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-12-06 21:02:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:02:09,189 INFO L225 Difference]: With dead ends: 70 [2021-12-06 21:02:09,189 INFO L226 Difference]: Without dead ends: 70 [2021-12-06 21:02:09,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-12-06 21:02:09,190 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 78 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:02:09,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 127 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:02:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-06 21:02:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-06 21:02:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 69 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2021-12-06 21:02:09,192 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 51 [2021-12-06 21:02:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:02:09,192 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2021-12-06 21:02:09,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2021-12-06 21:02:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-06 21:02:09,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:02:09,193 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:02:09,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-06 21:02:09,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:02:09,395 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:02:09,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:02:09,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1925550127, now seen corresponding path program 1 times [2021-12-06 21:02:09,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:02:09,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689129964] [2021-12-06 21:02:09,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:09,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:02:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:02:10,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:02:10,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689129964] [2021-12-06 21:02:10,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689129964] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:02:10,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391829111] [2021-12-06 21:02:10,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:10,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:02:10,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:02:10,149 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:02:10,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-06 21:02:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:10,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 97 conjunts are in the unsatisfiable core [2021-12-06 21:02:10,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:02:10,257 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-12-06 21:02:10,304 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:02:10,304 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 11 treesize of output 11 [2021-12-06 21:02:10,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:02:10,357 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-06 21:02:10,357 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 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 21:02:10,368 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:02:10,368 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-06 21:02:10,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:02:10,518 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 22 treesize of output 21 [2021-12-06 21:02:10,703 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:02:10,703 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 63 [2021-12-06 21:02:10,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2021-12-06 21:02:10,707 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 34 treesize of output 36 [2021-12-06 21:02:10,924 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 39 treesize of output 21 [2021-12-06 21:02:10,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-12-06 21:02:10,952 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-12-06 21:02:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:02:10,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:02:11,230 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 86 treesize of output 64 [2021-12-06 21:02:11,243 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 86 treesize of output 64 [2021-12-06 21:02:11,256 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_2253 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2253) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) (forall ((v_ArrVal_2250 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2250) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (<= |c_ULTIMATE.start_dll_update_at_~data#1| .cse0) (<= .cse0 |c_ULTIMATE.start_dll_update_at_~data#1|))) is different from false [2021-12-06 21:02:11,271 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_2250 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2250) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base|)) (forall ((v_ArrVal_2253 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2253) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= |c_ULTIMATE.start_dll_update_at_~data#1| .cse0) (<= .cse0 |c_ULTIMATE.start_dll_update_at_~data#1|))) is different from false [2021-12-06 21:02:11,280 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:11,280 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 50 treesize of output 47 [2021-12-06 21:02:11,283 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 17 treesize of output 13 [2021-12-06 21:02:13,423 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_2248 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2021-12-06 21:02:15,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2248 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2021-12-06 21:02:15,842 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2248 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))) is different from false [2021-12-06 21:02:16,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2248 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2021-12-06 21:02:16,269 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2246 (Array Int Int)) (v_ArrVal_2248 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2246) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2021-12-06 21:02:16,288 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2245 Int) (v_ArrVal_2246 (Array Int Int)) (v_ArrVal_2248 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2245)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2246) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2021-12-06 21:02:16,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:16,299 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:16,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2021-12-06 21:02:16,303 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 45 treesize of output 41 [2021-12-06 21:02:16,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:16,307 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 38 treesize of output 30 [2021-12-06 21:02:16,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:16,310 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 8 treesize of output 4 [2021-12-06 21:02:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-06 21:02:16,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391829111] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:02:16,380 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:02:16,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 26] total 62 [2021-12-06 21:02:16,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527568160] [2021-12-06 21:02:16,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:02:16,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-12-06 21:02:16,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:02:16,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-12-06 21:02:16,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2725, Unknown=8, NotChecked=888, Total=3782 [2021-12-06 21:02:16,382 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand has 62 states, 62 states have (on average 2.129032258064516) internal successors, (132), 62 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:17,164 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_ArrVal_2248 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))))) is different from false [2021-12-06 21:02:17,574 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2248 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) is different from false [2021-12-06 21:02:17,980 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2248 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_ULTIMATE.start_dll_create_#res#1.offset|) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0)) is different from false [2021-12-06 21:02:18,386 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_2248 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)) is different from false [2021-12-06 21:02:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:02:19,680 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2021-12-06 21:02:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-06 21:02:19,681 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.129032258064516) internal successors, (132), 62 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-12-06 21:02:19,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:02:19,681 INFO L225 Difference]: With dead ends: 68 [2021-12-06 21:02:19,681 INFO L226 Difference]: Without dead ends: 68 [2021-12-06 21:02:19,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=428, Invalid=5157, Unknown=13, NotChecked=1884, Total=7482 [2021-12-06 21:02:19,684 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 238 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 499 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 21:02:19,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 974 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1233 Invalid, 0 Unknown, 499 Unchecked, 0.5s Time] [2021-12-06 21:02:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-06 21:02:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-06 21:02:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.096774193548387) internal successors, (68), 67 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2021-12-06 21:02:19,685 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 52 [2021-12-06 21:02:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:02:19,685 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2021-12-06 21:02:19,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.129032258064516) internal successors, (132), 62 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2021-12-06 21:02:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-06 21:02:19,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:02:19,686 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:02:19,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-06 21:02:19,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-06 21:02:19,888 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:02:19,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:02:19,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317609, now seen corresponding path program 1 times [2021-12-06 21:02:19,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:02:19,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765614532] [2021-12-06 21:02:19,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:19,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:02:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-06 21:02:19,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:02:19,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765614532] [2021-12-06 21:02:19,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765614532] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:02:19,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:02:19,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 21:02:19,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651689405] [2021-12-06 21:02:19,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:02:19,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:02:19,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:02:19,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:02:19,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:02:19,968 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:02:20,061 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2021-12-06 21:02:20,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 21:02:20,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-12-06 21:02:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:02:20,062 INFO L225 Difference]: With dead ends: 79 [2021-12-06 21:02:20,062 INFO L226 Difference]: Without dead ends: 79 [2021-12-06 21:02:20,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:02:20,069 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 141 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:02:20,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 75 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:02:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-06 21:02:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2021-12-06 21:02:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.109375) internal successors, (71), 68 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2021-12-06 21:02:20,072 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 56 [2021-12-06 21:02:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:02:20,073 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2021-12-06 21:02:20,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2021-12-06 21:02:20,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-06 21:02:20,073 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:02:20,073 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:02:20,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-06 21:02:20,074 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:02:20,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:02:20,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317608, now seen corresponding path program 1 times [2021-12-06 21:02:20,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:02:20,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125874740] [2021-12-06 21:02:20,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:20,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:02:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 21:02:20,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:02:20,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125874740] [2021-12-06 21:02:20,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125874740] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:02:20,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:02:20,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 21:02:20,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243961476] [2021-12-06 21:02:20,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:02:20,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:02:20,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:02:20,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:02:20,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:02:20,146 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:02:20,249 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2021-12-06 21:02:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:02:20,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-12-06 21:02:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:02:20,250 INFO L225 Difference]: With dead ends: 77 [2021-12-06 21:02:20,250 INFO L226 Difference]: Without dead ends: 77 [2021-12-06 21:02:20,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:02:20,251 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 177 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:02:20,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 50 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:02:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-06 21:02:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2021-12-06 21:02:20,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:20,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2021-12-06 21:02:20,252 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 56 [2021-12-06 21:02:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:02:20,252 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2021-12-06 21:02:20,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2021-12-06 21:02:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 21:02:20,253 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:02:20,253 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:02:20,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-06 21:02:20,256 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:02:20,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:02:20,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1291305133, now seen corresponding path program 1 times [2021-12-06 21:02:20,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:02:20,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373377062] [2021-12-06 21:02:20,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:20,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:02:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 21:02:20,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:02:20,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373377062] [2021-12-06 21:02:20,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373377062] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:02:20,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:02:20,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 21:02:20,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920638728] [2021-12-06 21:02:20,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:02:20,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:02:20,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:02:20,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:02:20,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:02:20,299 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:20,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:02:20,364 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2021-12-06 21:02:20,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:02:20,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-12-06 21:02:20,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:02:20,364 INFO L225 Difference]: With dead ends: 74 [2021-12-06 21:02:20,365 INFO L226 Difference]: Without dead ends: 74 [2021-12-06 21:02:20,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:02:20,365 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 164 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:02:20,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 76 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:02:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-06 21:02:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2021-12-06 21:02:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 70 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2021-12-06 21:02:20,367 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 57 [2021-12-06 21:02:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:02:20,367 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2021-12-06 21:02:20,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2021-12-06 21:02:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 21:02:20,367 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:02:20,368 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:02:20,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-06 21:02:20,368 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:02:20,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:02:20,368 INFO L85 PathProgramCache]: Analyzing trace with hash 302765524, now seen corresponding path program 1 times [2021-12-06 21:02:20,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:02:20,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232625915] [2021-12-06 21:02:20,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:20,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:02:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 21:02:20,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:02:20,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232625915] [2021-12-06 21:02:20,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232625915] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:02:20,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:02:20,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 21:02:20,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503143366] [2021-12-06 21:02:20,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:02:20,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:02:20,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:02:20,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:02:20,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:02:20,415 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:02:20,498 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2021-12-06 21:02:20,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:02:20,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-06 21:02:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:02:20,498 INFO L225 Difference]: With dead ends: 72 [2021-12-06 21:02:20,498 INFO L226 Difference]: Without dead ends: 72 [2021-12-06 21:02:20,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:02:20,499 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 150 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:02:20,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 63 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:02:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-06 21:02:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-12-06 21:02:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 71 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2021-12-06 21:02:20,501 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2021-12-06 21:02:20,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:02:20,501 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2021-12-06 21:02:20,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:20,501 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2021-12-06 21:02:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-06 21:02:20,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:02:20,502 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:02:20,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-06 21:02:20,502 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:02:20,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:02:20,502 INFO L85 PathProgramCache]: Analyzing trace with hash 256575356, now seen corresponding path program 1 times [2021-12-06 21:02:20,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:02:20,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144737801] [2021-12-06 21:02:20,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:20,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:02:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 21:02:20,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:02:20,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144737801] [2021-12-06 21:02:20,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144737801] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:02:20,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436307704] [2021-12-06 21:02:20,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:20,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:02:20,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:02:20,797 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:02:20,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-06 21:02:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:20,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-06 21:02:20,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:02:20,924 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-12-06 21:02:20,947 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:02:20,947 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 11 treesize of output 11 [2021-12-06 21:02:20,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:02:20,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:02:20,969 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 33 treesize of output 26 [2021-12-06 21:02:20,987 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:02:20,987 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-06 21:02:21,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:02:21,043 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 24 [2021-12-06 21:02:21,126 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:02:21,126 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-06 21:02:21,211 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:21,211 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 27 treesize of output 23 [2021-12-06 21:02:21,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 21:02:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 21:02:21,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:02:21,425 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2613 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (forall ((v_ArrVal_2613 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-06 21:02:21,435 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2613 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2613 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1))) is different from false [2021-12-06 21:02:21,441 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2613 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (forall ((v_ArrVal_2613 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-06 21:02:21,451 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2613 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (forall ((v_ArrVal_2613 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2021-12-06 21:02:21,466 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= 1 (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2611)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2611)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-06 21:02:21,491 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) is different from false [2021-12-06 21:02:21,512 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) 1)) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))))))) is different from false [2021-12-06 21:02:21,532 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) is different from false [2021-12-06 21:02:21,569 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 1))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) is different from false [2021-12-06 21:02:21,583 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:21,583 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 83 treesize of output 87 [2021-12-06 21:02:21,629 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int) (v_ArrVal_2609 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_2609 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_prenex_9))) (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_8))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) is different from false [2021-12-06 21:02:21,687 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2607 Int) (v_prenex_8 (Array Int Int)) (v_ArrVal_2609 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2607)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_prenex_9))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_8))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (forall ((v_ArrVal_2607 Int) (v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int) (v_ArrVal_2609 (Array Int Int))) (not (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2607)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) is different from false [2021-12-06 21:02:21,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:21,704 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:21,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 164 treesize of output 115 [2021-12-06 21:02:21,707 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 169 treesize of output 159 [2021-12-06 21:02:21,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:21,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:21,723 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:21,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 163 treesize of output 165 [2021-12-06 21:02:21,729 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 221 treesize of output 211 [2021-12-06 21:02:21,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:21,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:21,748 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:21,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 216 treesize of output 218 [2021-12-06 21:02:21,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:21,764 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:21,765 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 165 treesize of output 166 [2021-12-06 21:02:21,771 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 155 treesize of output 151 [2021-12-06 21:02:21,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:21,783 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:21,783 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 156 treesize of output 157 [2021-12-06 21:02:21,789 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 146 treesize of output 142 [2021-12-06 21:02:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 13 not checked. [2021-12-06 21:02:22,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436307704] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:02:22,090 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:02:22,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 44 [2021-12-06 21:02:22,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309940025] [2021-12-06 21:02:22,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:02:22,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-06 21:02:22,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:02:22,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-06 21:02:22,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1032, Unknown=11, NotChecked=814, Total=1980 [2021-12-06 21:02:22,092 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:22,210 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2607 Int) (v_prenex_8 (Array Int Int)) (v_ArrVal_2609 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2607)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_prenex_9))) (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_8))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (forall ((v_ArrVal_2607 Int) (v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int) (v_ArrVal_2609 (Array Int Int))) (not (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2607)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) (select .cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| .cse0) 1))) is different from false [2021-12-06 21:02:24,213 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int) (v_ArrVal_2609 (Array Int Int))) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_2609 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_prenex_9))) (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) (select .cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_8))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2021-12-06 21:02:24,219 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int) (v_ArrVal_2609 (Array Int Int))) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_2609 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_prenex_9))) (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) (select .cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_8))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2021-12-06 21:02:24,223 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 1))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| .cse2) 1))) is different from false [2021-12-06 21:02:24,227 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) is different from false [2021-12-06 21:02:24,230 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (not (= |c_ULTIMATE.start_dll_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) 1)) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))))))) (= (select |c_#valid| .cse0) 1))) is different from false [2021-12-06 21:02:24,234 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 21:02:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:02:24,643 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2021-12-06 21:02:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 21:02:24,644 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-06 21:02:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:02:24,644 INFO L225 Difference]: With dead ends: 79 [2021-12-06 21:02:24,644 INFO L226 Difference]: Without dead ends: 79 [2021-12-06 21:02:24,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 101 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=231, Invalid=1715, Unknown=18, NotChecked=1818, Total=3782 [2021-12-06 21:02:24,646 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 108 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 731 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:02:24,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 430 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 641 Invalid, 0 Unknown, 731 Unchecked, 0.2s Time] [2021-12-06 21:02:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-06 21:02:24,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2021-12-06 21:02:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2021-12-06 21:02:24,647 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 62 [2021-12-06 21:02:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:02:24,648 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2021-12-06 21:02:24,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2021-12-06 21:02:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-06 21:02:24,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:02:24,648 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:02:24,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-06 21:02:24,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:02:24,849 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:02:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:02:24,850 INFO L85 PathProgramCache]: Analyzing trace with hash 256575357, now seen corresponding path program 1 times [2021-12-06 21:02:24,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:02:24,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913637603] [2021-12-06 21:02:24,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:24,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:02:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 21:02:25,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:02:25,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913637603] [2021-12-06 21:02:25,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913637603] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:02:25,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122079876] [2021-12-06 21:02:25,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:25,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:02:25,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:02:25,349 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:02:25,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-06 21:02:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:25,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 89 conjunts are in the unsatisfiable core [2021-12-06 21:02:25,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:02:25,465 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-12-06 21:02:25,522 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:02:25,522 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 11 treesize of output 11 [2021-12-06 21:02:25,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:02:25,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:02:25,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:02:25,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 21:02:25,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:02:25,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 21:02:25,616 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:02:25,616 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 21:02:25,620 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 22 treesize of output 24 [2021-12-06 21:02:25,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:02:25,773 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 19 treesize of output 18 [2021-12-06 21:02:25,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:02:25,776 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 24 [2021-12-06 21:02:25,897 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:02:25,897 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-06 21:02:25,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 18 treesize of output 20 [2021-12-06 21:02:26,043 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:26,044 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 17 treesize of output 17 [2021-12-06 21:02:26,047 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:26,048 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 27 treesize of output 23 [2021-12-06 21:02:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 21:02:26,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:02:26,373 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2749 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2750) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2021-12-06 21:02:26,384 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2749 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2750) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2021-12-06 21:02:26,391 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2749 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2750) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (forall ((v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2021-12-06 21:02:26,403 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2749 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2750) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (forall ((v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2021-12-06 21:02:26,422 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2747)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2748)) .cse0 v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_2750) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2748)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2747)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2021-12-06 21:02:26,456 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse0 v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_2750) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))))) is different from false [2021-12-06 21:02:26,481 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse0 v_ArrVal_2749) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) .cse0 v_ArrVal_2750) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))))) (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 4)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) is different from false [2021-12-06 21:02:26,516 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (and (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 4))) (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse0 v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_2750) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))))))))) is different from false [2021-12-06 21:02:26,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse0 v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_2750) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) is different from false [2021-12-06 21:02:26,583 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:26,583 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 120 treesize of output 124 [2021-12-06 21:02:26,668 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (and (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))) (forall ((v_prenex_18 Int) (v_ArrVal_2744 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_prenex_19 Int)) (<= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_18))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_20) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (v_prenex_19 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19))) (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2750))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) is different from false [2021-12-06 21:02:26,749 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (and (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2741 Int) (v_ArrVal_2750 (Array Int Int)) (v_prenex_19 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2741)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2750))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (forall ((v_ArrVal_2738 Int) (v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2741 Int) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (store (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_2738)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748))) (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_2741)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2749)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))) (forall ((v_ArrVal_2738 Int) (v_prenex_18 Int) (v_ArrVal_2744 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2741 Int) (v_prenex_19 Int)) (<= (select (select (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (store (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_2738)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_18))) (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_2741)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_20)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) is different from false [2021-12-06 21:02:26,762 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:26,770 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:26,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 248 treesize of output 229 [2021-12-06 21:02:26,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:26,784 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:26,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 229 treesize of output 214 [2021-12-06 21:02:26,788 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 254 treesize of output 248 [2021-12-06 21:02:26,792 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 370 treesize of output 362 [2021-12-06 21:02:26,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:26,811 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:26,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 386 treesize of output 394 [2021-12-06 21:02:26,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:26,817 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:26,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 382 treesize of output 358 [2021-12-06 21:02:26,824 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 412 treesize of output 402 [2021-12-06 21:02:26,836 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 442 treesize of output 436 [2021-12-06 21:02:26,844 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 558 treesize of output 550 [2021-12-06 21:02:26,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:26,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:26,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 538 treesize of output 514 [2021-12-06 21:02:26,860 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:26,872 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:26,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 538 treesize of output 546 [2021-12-06 21:02:26,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:26,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:26,896 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:26,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 550 treesize of output 552 [2021-12-06 21:02:26,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:26,916 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 439 treesize of output 423 [2021-12-06 21:02:26,922 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:26,924 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 411 treesize of output 395 [2021-12-06 21:02:26,932 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 419 treesize of output 415 [2021-12-06 21:02:26,939 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 415 treesize of output 407 [2021-12-06 21:02:26,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:02:26,954 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:26,954 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 411 treesize of output 412 [2021-12-06 21:02:26,962 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 401 treesize of output 397 [2021-12-06 21:02:26,971 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 421 treesize of output 417 [2021-12-06 21:02:26,984 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 417 treesize of output 409 [2021-12-06 21:02:27,346 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 13 not checked. [2021-12-06 21:02:27,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122079876] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:02:27,347 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:02:27,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 21] total 60 [2021-12-06 21:02:27,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470874793] [2021-12-06 21:02:27,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:02:27,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-12-06 21:02:27,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:02:27,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-12-06 21:02:27,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2283, Unknown=11, NotChecked=1166, Total=3660 [2021-12-06 21:02:27,350 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 61 states, 60 states have (on average 2.7333333333333334) internal successors, (164), 61 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:29,759 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (and (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))) (forall ((v_prenex_18 Int) (v_ArrVal_2744 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_prenex_19 Int)) (<= (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_18))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_20) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (v_prenex_19 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19))) (store (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) (select .cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2750))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))) is different from false [2021-12-06 21:02:29,765 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (and (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))) (forall ((v_prenex_18 Int) (v_ArrVal_2744 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_prenex_19 Int)) (<= (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_18))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_20) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (v_prenex_19 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19))) (store (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) (select .cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2750))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))) is different from false [2021-12-06 21:02:29,771 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse2 (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse2 v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) .cse2 v_ArrVal_2750) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (= 12 (select |c_#length| .cse1))))) is different from false [2021-12-06 21:02:29,776 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (select |c_#length| .cse0) 12) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (and (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 4))) (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse1 v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2) .cse1 v_ArrVal_2750) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) is different from false [2021-12-06 21:02:29,781 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= 12 (select |c_#length| .cse0)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse1 v_ArrVal_2749) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse2) .cse1 v_ArrVal_2750) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))))) (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 4)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2021-12-06 21:02:29,785 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#length| .cse0) 12) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse1 v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse1 v_ArrVal_2750) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 21:02:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:02:30,835 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2021-12-06 21:02:30,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 21:02:30,835 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.7333333333333334) internal successors, (164), 61 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-06 21:02:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:02:30,835 INFO L225 Difference]: With dead ends: 83 [2021-12-06 21:02:30,835 INFO L226 Difference]: Without dead ends: 83 [2021-12-06 21:02:30,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=428, Invalid=3913, Unknown=17, NotChecked=2448, Total=6806 [2021-12-06 21:02:30,838 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 217 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 826 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 21:02:30,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 681 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 916 Invalid, 0 Unknown, 826 Unchecked, 0.4s Time] [2021-12-06 21:02:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-06 21:02:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2021-12-06 21:02:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2021-12-06 21:02:30,839 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 62 [2021-12-06 21:02:30,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:02:30,839 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2021-12-06 21:02:30,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.7333333333333334) internal successors, (164), 61 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:02:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2021-12-06 21:02:30,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-06 21:02:30,840 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:02:30,840 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:02:30,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-12-06 21:02:31,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:02:31,041 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:02:31,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:02:31,042 INFO L85 PathProgramCache]: Analyzing trace with hash -636099954, now seen corresponding path program 1 times [2021-12-06 21:02:31,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:02:31,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911118975] [2021-12-06 21:02:31,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:31,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:02:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 21:02:31,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:02:31,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911118975] [2021-12-06 21:02:31,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911118975] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:02:31,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556416694] [2021-12-06 21:02:31,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:02:31,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:02:31,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:02:31,415 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:02:31,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-06 21:02:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:02:31,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-06 21:02:31,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:02:31,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 21:02:31,616 INFO L354 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2021-12-06 21:02:31,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 29 [2021-12-06 21:02:31,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:02:31,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:02:31,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 21:02:31,718 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:02:31,718 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-06 21:02:31,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:02:31,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-12-06 21:02:31,958 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-06 21:02:31,958 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 1 case distinctions, treesize of input 29 treesize of output 32 [2021-12-06 21:02:32,224 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-12-06 21:02:32,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 21:02:32,290 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:02:32,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-06 21:02:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 21:02:32,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:03:43,161 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:03:43,167 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:03:43,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 213 treesize of output 113 [2021-12-06 21:03:43,182 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:03:43,182 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 1447 treesize of output 1389 [2021-12-06 21:03:43,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:03:43,209 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:03:43,209 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 1749 treesize of output 1663 [2021-12-06 21:03:43,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:03:44,000 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:03:44,001 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 277 treesize of output 269 [2021-12-06 21:04:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 9 refuted. 9 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 21:04:09,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556416694] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:04:09,945 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:04:09,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 56 [2021-12-06 21:04:09,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892753704] [2021-12-06 21:04:09,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:04:09,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-12-06 21:04:09,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:04:09,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-12-06 21:04:09,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2742, Unknown=70, NotChecked=0, Total=3080 [2021-12-06 21:04:09,947 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 56 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:04:12,103 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.base_47| Int) (v_ArrVal_2876 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_45| Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int) (v_ArrVal_2879 Int)) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| v_ArrVal_2876)))) (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.base_47| (store (select .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.base_47|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_45| v_ArrVal_2879))) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|) (not (= (select .cse0 4) 0)) (not (= (select |c_#valid| (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 1))))) (= (select |c_#valid| 0) 0)) is different from false [2021-12-06 21:04:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:04:13,246 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2021-12-06 21:04:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-06 21:04:13,246 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-12-06 21:04:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:04:13,247 INFO L225 Difference]: With dead ends: 80 [2021-12-06 21:04:13,247 INFO L226 Difference]: Without dead ends: 80 [2021-12-06 21:04:13,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 99.5s TimeCoverageRelationStatistics Valid=736, Invalid=5203, Unknown=71, NotChecked=152, Total=6162 [2021-12-06 21:04:13,248 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 392 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 21:04:13,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 867 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 558 Invalid, 0 Unknown, 360 Unchecked, 0.3s Time] [2021-12-06 21:04:13,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-06 21:04:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2021-12-06 21:04:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 76 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:04:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2021-12-06 21:04:13,250 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 63 [2021-12-06 21:04:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:04:13,250 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2021-12-06 21:04:13,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:04:13,250 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2021-12-06 21:04:13,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 21:04:13,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:04:13,250 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:04:13,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-12-06 21:04:13,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-06 21:04:13,451 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:04:13,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:04:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1405249969, now seen corresponding path program 1 times [2021-12-06 21:04:13,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:04:13,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289308266] [2021-12-06 21:04:13,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:04:13,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:04:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:04:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 21:04:13,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:04:13,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289308266] [2021-12-06 21:04:13,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289308266] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:04:13,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119007929] [2021-12-06 21:04:13,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:04:13,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:04:13,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:04:13,914 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:04:13,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-06 21:04:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:04:14,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-06 21:04:14,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:04:14,041 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-12-06 21:04:14,087 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:04:14,087 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 11 treesize of output 11 [2021-12-06 21:04:14,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:04:14,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:04:14,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 21:04:14,158 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:04:14,158 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-06 21:04:14,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:04:14,231 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 24 [2021-12-06 21:04:14,357 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:04:14,357 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-06 21:04:14,495 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:04:14,495 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 27 treesize of output 23 [2021-12-06 21:04:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 21:04:14,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:04:14,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3006 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_3006) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-06 21:04:14,700 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3006 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_3006) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-06 21:04:14,705 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3006 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_3006) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-06 21:04:14,712 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3006 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_3006) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-06 21:04:14,722 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3005 Int) (v_ArrVal_3006 (Array Int Int))) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_3005)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_3006)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-06 21:04:14,735 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3005 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3006 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3005))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_3006)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 21:04:14,746 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3005 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3006 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3005))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_3006)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 21:04:14,757 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3005 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3006 (Array Int Int))) (or (<= (+ (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3005))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_3006)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|))) is different from false [2021-12-06 21:04:14,775 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3005 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3006 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3005))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3006)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 21:04:14,787 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3003 (Array Int Int)) (v_ArrVal_3005 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3006 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3003))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3005))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3006))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 21:04:14,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3003 (Array Int Int)) (v_ArrVal_3005 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3006 (Array Int Int)) (v_ArrVal_3002 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_3002)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3003))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3005))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3006))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 21:04:14,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:04:14,820 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:04:14,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 59 [2021-12-06 21:04:14,824 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 108 treesize of output 100 [2021-12-06 21:04:14,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:04:14,834 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:04:14,834 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 61 treesize of output 57 [2021-12-06 21:04:14,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:04:14,845 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:04:14,845 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 51 treesize of output 52 [2021-12-06 21:04:14,848 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 84 treesize of output 80 [2021-12-06 21:04:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 13 not checked. [2021-12-06 21:04:15,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119007929] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:04:15,150 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:04:15,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 21] total 46 [2021-12-06 21:04:15,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749538615] [2021-12-06 21:04:15,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:04:15,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-06 21:04:15,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:04:15,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-06 21:04:15,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1157, Unknown=11, NotChecked=858, Total=2162 [2021-12-06 21:04:15,152 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:04:15,343 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_dll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_3003 (Array Int Int)) (v_ArrVal_3005 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3006 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3003))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3005))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3006))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 1) |c_#StackHeapBarrier|)))) is different from false [2021-12-06 21:04:15,347 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ |c_ULTIMATE.start_dll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_3003 (Array Int Int)) (v_ArrVal_3005 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3006 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3003))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3005))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3006))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 1) |c_#StackHeapBarrier|)))) is different from false [2021-12-06 21:04:15,351 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_3005 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3006 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3005))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3006)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 1) |c_#StackHeapBarrier|))))) is different from false [2021-12-06 21:04:15,356 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (forall ((v_ArrVal_3005 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3006 (Array Int Int))) (or (<= (+ (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3005))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_3006)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1)) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) is different from false [2021-12-06 21:04:15,360 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (not (= |c_ULTIMATE.start_dll_create_#res#1.base| .cse0)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_3005 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3006 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3005))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_3006)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 1) |c_#StackHeapBarrier|))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2021-12-06 21:04:15,364 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((v_ArrVal_3005 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3006 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3005))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_3006)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|))) (<= (+ 1 .cse0) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 21:04:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:04:16,033 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2021-12-06 21:04:16,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 21:04:16,033 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-06 21:04:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:04:16,034 INFO L225 Difference]: With dead ends: 78 [2021-12-06 21:04:16,034 INFO L226 Difference]: Without dead ends: 78 [2021-12-06 21:04:16,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=318, Invalid=2183, Unknown=17, NotChecked=1904, Total=4422 [2021-12-06 21:04:16,035 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 233 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 692 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 21:04:16,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 487 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 509 Invalid, 0 Unknown, 692 Unchecked, 0.3s Time] [2021-12-06 21:04:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-06 21:04:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-06 21:04:16,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 77 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:04:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2021-12-06 21:04:16,036 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 65 [2021-12-06 21:04:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:04:16,037 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2021-12-06 21:04:16,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:04:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2021-12-06 21:04:16,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-06 21:04:16,037 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:04:16,037 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:04:16,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2021-12-06 21:04:16,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-06 21:04:16,238 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 21:04:16,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:04:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash -755420895, now seen corresponding path program 2 times [2021-12-06 21:04:16,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:04:16,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597003331] [2021-12-06 21:04:16,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:04:16,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:04:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:04:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 21:04:17,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:04:17,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597003331] [2021-12-06 21:04:17,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597003331] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:04:17,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98501298] [2021-12-06 21:04:17,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:04:17,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:04:17,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:04:17,123 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:04:17,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cef3a2-c2cf-4947-a0ee-d871ee8c326c/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-06 21:04:17,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 21:04:17,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:04:17,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 119 conjunts are in the unsatisfiable core [2021-12-06 21:04:17,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:04:17,264 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-12-06 21:04:17,284 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-12-06 21:04:17,288 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-12-06 21:04:17,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:04:17,298 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 23 treesize of output 22 [2021-12-06 21:04:17,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:04:17,301 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 23 treesize of output 22 [2021-12-06 21:04:17,355 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:04:17,355 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 11 treesize of output 11 [2021-12-06 21:04:17,404 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 14 treesize of output 16 [2021-12-06 21:04:17,408 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 14 treesize of output 16 [2021-12-06 21:04:17,421 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 21 treesize of output 20 [2021-12-06 21:04:17,426 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 21 treesize of output 20 [2021-12-06 21:04:17,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-06 21:04:17,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-06 21:04:17,551 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 21:04:17,551 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 69 treesize of output 50 [2021-12-06 21:04:17,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-06 21:04:17,805 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-06 21:04:17,805 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 30 treesize of output 36 [2021-12-06 21:04:17,822 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-12-06 21:04:17,822 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 42 treesize of output 43 [2021-12-06 21:04:18,336 INFO L354 Elim1Store]: treesize reduction 62, result has 44.6 percent of original size [2021-12-06 21:04:18,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 89 [2021-12-06 21:04:18,388 INFO L354 Elim1Store]: treesize reduction 54, result has 51.8 percent of original size [2021-12-06 21:04:18,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 82 [2021-12-06 21:04:28,680 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-12-06 21:04:28,680 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 57 treesize of output 38 [2021-12-06 21:04:28,687 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:04:28,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-12-06 21:04:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 21:04:28,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:05:04,139 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_52| Int) (v_ArrVal_3150 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int)) (or (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (and (forall ((v_ArrVal_3157 Int) (v_ArrVal_3156 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse1 (select .cse3 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3156))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3))) (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157))) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) 4) 0)) (forall ((v_ArrVal_3157 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse4 (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse7)) (.cse6 (select .cse7 4))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157)))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_52|))) is different from false [2021-12-06 21:05:06,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_52| Int) (v_ArrVal_3150 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int)) (or (and (forall ((v_ArrVal_3157 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse0 (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_3157 Int) (v_ArrVal_3156 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse5 (select .cse7 4))) (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150)))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3156))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse7))) (store .cse6 .cse5 (store (select .cse6 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157))) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))) 4) 0))) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_52|))) is different from false [2021-12-06 21:05:08,323 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_52| Int) (v_ArrVal_3150 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int)) (or (and (forall ((v_ArrVal_3157 Int) (v_ArrVal_3156 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse1 (select .cse3 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3156))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse3))) (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))) 4) 0)) (forall ((v_ArrVal_3157 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse4 (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse7)) (.cse6 (select .cse7 4))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157)))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) 4) 0))) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_52|))) is different from false [2021-12-06 21:05:10,488 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_52| Int) (v_ArrVal_3150 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int)) (or (and (forall ((v_ArrVal_3157 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse0 (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_3157 Int) (v_ArrVal_3156 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse5 (select .cse7 4))) (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150)))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3156))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7))) (store .cse6 .cse5 (store (select .cse6 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) 4) 0))) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_52|))) is different from false [2021-12-06 21:05:12,692 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_52| Int) (v_ArrVal_3150 Int) (v_ArrVal_3148 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_3148)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_52|) (and (forall ((v_ArrVal_3146 Int) (v_ArrVal_3157 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_3146)))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse1 (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157))))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_3146 Int) (v_ArrVal_3157 Int) (v_ArrVal_3156 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse8 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_3146)))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse6 (select .cse11 4))) (select (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_3148)))) (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150))))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3156))) (select (select (let ((.cse9 (store .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse11))) (store .cse9 .cse6 (store (select .cse9 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) 4) 0))))) is different from false [2021-12-06 21:05:15,145 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_52| Int) (v_ArrVal_3150 Int) (v_ArrVal_3148 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int) (v_ArrVal_3145 Int)) (or (and (forall ((v_ArrVal_3146 Int) (v_ArrVal_3157 Int) (v_ArrVal_3144 Int) (v_ArrVal_3156 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse7 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_3144)))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_3146))))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse1 (select .cse8 4))) (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_3145)))) (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_3148))))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150))))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3156))) (select (select (let ((.cse6 (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse8))) (store .cse6 .cse1 (store (select .cse6 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) 4) 0)) (forall ((v_ArrVal_3146 Int) (v_ArrVal_3157 Int) (v_ArrVal_3144 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse10 (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_3144)))) (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_3146))))) (let ((.cse13 (store (select .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse11 (store .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse13)) (.cse12 (select .cse13 4))) (store .cse11 .cse12 (store (select .cse11 .cse12) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157))))))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_52|) (< (select (store (select (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_3145)))) (store .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_3148))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|))) is different from false [2021-12-06 21:05:18,385 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_52| Int) (v_ArrVal_3150 Int) (v_ArrVal_3139 Int) (v_ArrVal_3148 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int) (v_ArrVal_3145 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_ArrVal_3139) (and (forall ((v_ArrVal_3146 Int) (v_ArrVal_3157 Int) (v_ArrVal_3144 Int) (v_ArrVal_3156 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse8 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_3144)))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_3146))))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse1 (select .cse9 4))) (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_3139) .cse6 v_ArrVal_3145)))) (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_3148))))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150))))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3156))) (select (select (let ((.cse7 (store .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse9))) (store .cse7 .cse1 (store (select .cse7 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) 4) 0)) (forall ((v_ArrVal_3146 Int) (v_ArrVal_3157 Int) (v_ArrVal_3144 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse11 (let ((.cse15 (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_3144)))) (store .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_3146))))) (let ((.cse14 (store (select .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse12 (store .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse14)) (.cse13 (select .cse14 4))) (store .cse12 .cse13 (store (select .cse12 .cse13) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157))))))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0))) (< (select (store (select (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_3139) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_3145)))) (store .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_3148))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_52|))) is different from false [2021-12-06 21:05:18,540 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-12-06 21:05:18,540 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 1086 treesize of output 1002 [2021-12-06 21:05:18,713 INFO L354 Elim1Store]: treesize reduction 50, result has 39.8 percent of original size [2021-12-06 21:05:18,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1002 treesize of output 634 [2021-12-06 21:05:18,746 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 8 treesize of output 4 [2021-12-06 21:05:18,876 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 8 treesize of output 4 [2021-12-06 21:05:19,358 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 8 treesize of output 4 [2021-12-06 21:05:19,506 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 8 treesize of output 4 [2021-12-06 21:05:20,112 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 8 treesize of output 4 [2021-12-06 21:05:20,327 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 8 treesize of output 4 [2021-12-06 21:05:20,369 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_22 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_52| Int) (v_ArrVal_3150 Int) (v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_3148 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select v_arrayElimArr_22 .cse0))) (and (forall ((v_prenex_38 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (= (select (let ((.cse1 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_21))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_prenex_35))))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_prenex_38))) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_prenex_36))))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_3146 Int) (v_ArrVal_3157 Int) (v_ArrVal_3156 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse11 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_22))) (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse11 v_ArrVal_3146))))) (let ((.cse14 (store (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse8 (select .cse14 4))) (select (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_20))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse11 v_ArrVal_3148))))) (store .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150))))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3156))) (select (select (let ((.cse12 (store .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse14))) (store .cse12 .cse8 (store (select .cse12 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) 4) 0))) (< (select (store (select (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_20))) (store .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_3148))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_20 .cse0)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_52|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select v_arrayElimArr_21 .cse0)))))) is different from false [2021-12-06 21:05:20,399 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 8 treesize of output 4 [2021-12-06 21:05:20,529 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 8 treesize of output 4 [2021-12-06 21:05:21,106 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 8 treesize of output 4 [2021-12-06 21:05:21,324 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 8 treesize of output 4 [2021-12-06 21:05:21,389 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-12-06 21:05:21,497 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-12-06 21:05:22,358 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-12-06 21:05:22,623 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-12-06 21:05:22,660 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| Int) (v_arrayElimArr_22 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_52| Int) (v_ArrVal_3150 Int) (v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_3148 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int) (v_arrayElimArr_20 (Array Int Int))) (or (< (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| v_arrayElimArr_20))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_3148))) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select v_arrayElimArr_21 4))) (and (forall ((v_prenex_38 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (= (select (let ((.cse1 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| v_arrayElimArr_21))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_prenex_35))))) (let ((.cse4 (store (select .cse5 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_prenex_38))) (let ((.cse2 (store .cse5 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_prenex_36))))))) (select .cse1 (select (select .cse1 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) 4))) 4) 0)) (forall ((v_ArrVal_3146 Int) (v_ArrVal_3157 Int) (v_ArrVal_3156 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse11 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| v_arrayElimArr_22))) (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse11 v_ArrVal_3146))))) (let ((.cse14 (store (select .cse13 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse8 (select .cse14 4))) (select (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| v_arrayElimArr_20))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse11 v_ArrVal_3148))))) (store .cse9 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| (store (select .cse9 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150))))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3156))) (select (select (let ((.cse12 (store .cse13 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| .cse14))) (store .cse12 .cse8 (store (select .cse12 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157))) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) 4)))))) 4) 0))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_20 4)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select v_arrayElimArr_22 4))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_52|))) is different from false [2021-12-06 21:05:22,711 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 8 treesize of output 6 [2021-12-06 21:05:23,374 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 8 treesize of output 6 [2021-12-06 21:05:23,460 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 8 treesize of output 6 [2021-12-06 21:05:23,528 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 372 treesize of output 316 [2021-12-06 21:05:23,614 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 372 treesize of output 316 [2021-12-06 21:05:23,922 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 8 treesize of output 6 [2021-12-06 21:05:24,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| Int) (v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_52| Int) (v_ArrVal_3150 Int) (v_ArrVal_3148 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_21 4))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_20 4)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|))) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| v_arrayElimArr_20))) (store .cse1 .cse0 (store (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_3148))) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (and (forall ((v_prenex_38 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (= (select (let ((.cse2 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| v_arrayElimArr_21)) (.cse8 (select v_arrayElimArr_21 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_prenex_35))))) (let ((.cse5 (store (select .cse6 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_prenex_38))) (let ((.cse3 (store .cse6 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| .cse5)) (.cse4 (select .cse5 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_prenex_36))))))) (select .cse2 (select (select .cse2 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) 4))) 4) 0)) (forall ((v_ArrVal_3146 Int) (v_ArrVal_3157 Int) (v_ArrVal_3156 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse13 (select v_arrayElimArr_21 4)) (.cse14 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse16 (let ((.cse18 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| v_arrayElimArr_22))) (store .cse18 .cse13 (store (select .cse18 .cse13) .cse14 v_ArrVal_3146))))) (let ((.cse17 (store (select .cse16 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse10 (select .cse17 4))) (select (let ((.cse9 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| v_arrayElimArr_20))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_ArrVal_3148))))) (store .cse11 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| (store (select .cse11 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150))))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3156))) (select (select (let ((.cse15 (store .cse16 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| .cse17))) (store .cse15 .cse10 (store (select .cse15 .cse10) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157))) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) 4)))))) 4) 0))) (not (= .cse0 (select v_arrayElimArr_22 4))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_52|)))) is different from false [2021-12-06 21:05:24,261 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 8 treesize of output 6 [2021-12-06 21:05:24,989 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 8 treesize of output 6 [2021-12-06 21:05:25,078 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 8 treesize of output 6 [2021-12-06 21:05:25,136 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 372 treesize of output 316 [2021-12-06 21:05:25,217 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 372 treesize of output 316 [2021-12-06 21:05:25,515 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 8 treesize of output 6 [2021-12-06 21:05:25,876 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 8 treesize of output 6 [2021-12-06 21:05:26,705 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 8 treesize of output 6 [2021-12-06 21:05:26,833 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 632 treesize of output 576 [2021-12-06 21:05:26,950 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 8 treesize of output 6 [2021-12-06 21:05:27,072 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 8 treesize of output 6 [2021-12-06 21:05:27,954 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 8 treesize of output 6 [2021-12-06 21:05:28,077 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 632 treesize of output 576 [2021-12-06 21:05:28,182 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 8 treesize of output 6 [2021-12-06 21:05:28,300 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 8 treesize of output 6 [2021-12-06 21:05:28,625 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 632 treesize of output 576 [2021-12-06 21:05:28,990 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| Int) (v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_52| Int) (v_ArrVal_3150 Int) (v_ArrVal_3148 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int) (v_ArrVal_3133 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_21 4))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_20 4)) (< (select (store (select (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_3133)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| v_arrayElimArr_20))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3148)))) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|))) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (and (forall ((v_ArrVal_3146 Int) (v_ArrVal_3157 Int) (v_ArrVal_3156 Int) (v_ArrVal_3132 Int) (v_ArrVal_3151 Int)) (= (select (let ((.cse7 (select v_arrayElimArr_21 4)) (.cse8 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse10 (let ((.cse12 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse8 v_ArrVal_3132)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| v_arrayElimArr_22))) (store .cse12 .cse7 (store (select .cse12 .cse7) .cse8 v_ArrVal_3146))))) (let ((.cse11 (store (select .cse10 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3151))) (let ((.cse4 (select .cse11 4))) (select (let ((.cse3 (let ((.cse5 (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse8 v_ArrVal_3133)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| v_arrayElimArr_20))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_ArrVal_3148))))) (store .cse5 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| (store (select .cse5 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_ArrVal_3150))))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3156))) (select (select (let ((.cse9 (store .cse10 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| .cse11))) (store .cse9 .cse4 (store (select .cse9 .cse4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_ArrVal_3157))) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) 4)))))) 4) 0)) (forall ((v_prenex_38 Int) (v_prenex_36 Int) (v_prenex_35 Int) (v_ArrVal_3132 Int)) (= (select (let ((.cse13 (let ((.cse17 (let ((.cse20 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse18 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse20 v_ArrVal_3132)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| v_arrayElimArr_21)) (.cse19 (select v_arrayElimArr_21 4))) (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 v_prenex_35)))))) (let ((.cse16 (store (select .cse17 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_52| v_prenex_38))) (let ((.cse14 (store .cse17 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| .cse16)) (.cse15 (select .cse16 4))) (store .cse14 .cse15 (store (select .cse14 .cse15) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_prenex_36))))))) (select .cse13 (select (select .cse13 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51|) 4))) 4) 0))) (not (= .cse1 (select v_arrayElimArr_22 4))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_52|)))) is different from false [2021-12-06 21:05:29,021 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:05:29,057 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:05:29,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1436 treesize of output 1306 [2021-12-06 21:05:29,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:05:29,126 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:05:29,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1306 treesize of output 746 [2021-12-06 21:05:29,456 INFO L354 Elim1Store]: treesize reduction 172, result has 57.7 percent of original size [2021-12-06 21:05:29,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23238466 treesize of output 22463780 [2021-12-06 21:05:34,535 INFO L354 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2021-12-06 21:05:34,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 928009065 treesize of output 838925087