./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0 --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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 14:34:18,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 14:34:18,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 14:34:18,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 14:34:18,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 14:34:18,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 14:34:18,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 14:34:18,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 14:34:18,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 14:34:18,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 14:34:18,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 14:34:18,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 14:34:18,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 14:34:18,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 14:34:18,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 14:34:18,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 14:34:18,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 14:34:18,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 14:34:18,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 14:34:18,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 14:34:18,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 14:34:18,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 14:34:18,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 14:34:18,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 14:34:18,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 14:34:18,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 14:34:18,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 14:34:18,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 14:34:18,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 14:34:18,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 14:34:18,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 14:34:18,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 14:34:18,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 14:34:18,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 14:34:18,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 14:34:18,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 14:34:18,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 14:34:18,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 14:34:18,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 14:34:18,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 14:34:18,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 14:34:18,574 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-22 14:34:18,600 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 14:34:18,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 14:34:18,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 14:34:18,601 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 14:34:18,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 14:34:18,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 14:34:18,602 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 14:34:18,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 14:34:18,603 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 14:34:18,603 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-22 14:34:18,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 14:34:18,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 14:34:18,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 14:34:18,604 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-22 14:34:18,604 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-22 14:34:18,605 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-22 14:34:18,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 14:34:18,605 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-22 14:34:18,605 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 14:34:18,606 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 14:34:18,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 14:34:18,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 14:34:18,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 14:34:18,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 14:34:18,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 14:34:18,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 14:34:18,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 14:34:18,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 14:34:18,608 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 14:34:18,608 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_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/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_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2021-11-22 14:34:18,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 14:34:18,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 14:34:18,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 14:34:18,887 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 14:34:18,888 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 14:34:18,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/../../sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-11-22 14:34:18,970 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/data/00522ef0a/2124c968f2aa43af99f21e82c6273e35/FLAG1575817b0 [2021-11-22 14:34:19,535 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 14:34:19,536 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-11-22 14:34:19,548 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/data/00522ef0a/2124c968f2aa43af99f21e82c6273e35/FLAG1575817b0 [2021-11-22 14:34:19,830 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/data/00522ef0a/2124c968f2aa43af99f21e82c6273e35 [2021-11-22 14:34:19,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 14:34:19,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 14:34:19,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 14:34:19,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 14:34:19,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 14:34:19,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:34:19" (1/1) ... [2021-11-22 14:34:19,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66204529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:34:19, skipping insertion in model container [2021-11-22 14:34:19,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:34:19" (1/1) ... [2021-11-22 14:34:19,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 14:34:19,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 14:34:20,252 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_1b388123-1b58-43e2-9813-ca8e884c1f2c/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2021-11-22 14:34:20,260 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 14:34:20,274 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 14:34:20,327 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_1b388123-1b58-43e2-9813-ca8e884c1f2c/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2021-11-22 14:34:20,328 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 14:34:20,373 INFO L208 MainTranslator]: Completed translation [2021-11-22 14:34:20,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:34:20 WrapperNode [2021-11-22 14:34:20,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 14:34:20,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 14:34:20,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 14:34:20,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 14:34:20,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:34:20" (1/1) ... [2021-11-22 14:34:20,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:34:20" (1/1) ... [2021-11-22 14:34:20,428 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 9, calls inlined = 10, statements flattened = 151 [2021-11-22 14:34:20,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 14:34:20,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 14:34:20,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 14:34:20,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 14:34:20,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:34:20" (1/1) ... [2021-11-22 14:34:20,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:34:20" (1/1) ... [2021-11-22 14:34:20,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:34:20" (1/1) ... [2021-11-22 14:34:20,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:34:20" (1/1) ... [2021-11-22 14:34:20,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:34:20" (1/1) ... [2021-11-22 14:34:20,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:34:20" (1/1) ... [2021-11-22 14:34:20,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:34:20" (1/1) ... [2021-11-22 14:34:20,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 14:34:20,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 14:34:20,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 14:34:20,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 14:34:20,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:34:20" (1/1) ... [2021-11-22 14:34:20,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 14:34:20,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:34:20,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 14:34:20,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 14:34:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 14:34:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 14:34:20,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 14:34:20,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 14:34:20,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 14:34:20,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 14:34:20,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 14:34:20,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 14:34:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 14:34:20,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 14:34:20,699 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 14:34:20,701 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 14:34:21,091 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 14:34:21,100 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 14:34:21,101 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-22 14:34:21,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:34:21 BoogieIcfgContainer [2021-11-22 14:34:21,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 14:34:21,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 14:34:21,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 14:34:21,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 14:34:21,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:34:19" (1/3) ... [2021-11-22 14:34:21,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db2ea7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:34:21, skipping insertion in model container [2021-11-22 14:34:21,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:34:20" (2/3) ... [2021-11-22 14:34:21,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db2ea7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:34:21, skipping insertion in model container [2021-11-22 14:34:21,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:34:21" (3/3) ... [2021-11-22 14:34:21,123 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2021-11-22 14:34:21,129 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 14:34:21,131 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2021-11-22 14:34:21,193 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 14:34:21,200 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 14:34:21,201 INFO L340 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2021-11-22 14:34:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 59 states have (on average 1.9661016949152543) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-22 14:34:21,231 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:21,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-22 14:34:21,232 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:21,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:21,239 INFO L85 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2021-11-22 14:34:21,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:21,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156239103] [2021-11-22 14:34:21,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:21,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:21,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:21,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156239103] [2021-11-22 14:34:21,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156239103] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:21,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:21,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 14:34:21,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987859924] [2021-11-22 14:34:21,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:21,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:34:21,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:21,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:34:21,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:34:21,456 INFO L87 Difference]: Start difference. First operand has 100 states, 59 states have (on average 1.9661016949152543) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:21,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:21,571 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2021-11-22 14:34:21,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:34:21,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-22 14:34:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:21,582 INFO L225 Difference]: With dead ends: 116 [2021-11-22 14:34:21,583 INFO L226 Difference]: Without dead ends: 110 [2021-11-22 14:34:21,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:34:21,588 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 97 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:21,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 72 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:34:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-22 14:34:21,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 90. [2021-11-22 14:34:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.7321428571428572) internal successors, (97), 89 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2021-11-22 14:34:21,630 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 4 [2021-11-22 14:34:21,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:21,630 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2021-11-22 14:34:21,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2021-11-22 14:34:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-22 14:34:21,631 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:21,631 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-22 14:34:21,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 14:34:21,632 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:21,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:21,633 INFO L85 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2021-11-22 14:34:21,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:21,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965732774] [2021-11-22 14:34:21,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:21,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:21,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:21,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965732774] [2021-11-22 14:34:21,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965732774] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:21,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:21,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 14:34:21,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141581568] [2021-11-22 14:34:21,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:21,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:34:21,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:21,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:34:21,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:34:21,692 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:21,758 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2021-11-22 14:34:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:34:21,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-22 14:34:21,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:21,760 INFO L225 Difference]: With dead ends: 84 [2021-11-22 14:34:21,760 INFO L226 Difference]: Without dead ends: 84 [2021-11-22 14:34:21,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:34:21,762 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:21,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 60 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:34:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-22 14:34:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-11-22 14:34:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.625) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2021-11-22 14:34:21,772 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 4 [2021-11-22 14:34:21,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:21,772 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2021-11-22 14:34:21,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2021-11-22 14:34:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-22 14:34:21,773 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:21,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:34:21,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 14:34:21,774 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:21,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:21,774 INFO L85 PathProgramCache]: Analyzing trace with hash 613332465, now seen corresponding path program 1 times [2021-11-22 14:34:21,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:21,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522198349] [2021-11-22 14:34:21,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:21,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:21,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:21,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522198349] [2021-11-22 14:34:21,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522198349] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:21,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:21,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:34:21,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864636121] [2021-11-22 14:34:21,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:21,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:34:21,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:21,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:34:21,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:34:21,850 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:21,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:21,869 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2021-11-22 14:34:21,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:34:21,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-11-22 14:34:21,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:21,871 INFO L225 Difference]: With dead ends: 99 [2021-11-22 14:34:21,871 INFO L226 Difference]: Without dead ends: 99 [2021-11-22 14:34:21,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:34:21,873 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 15 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:21,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 170 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:34:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-22 14:34:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2021-11-22 14:34:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 84 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2021-11-22 14:34:21,886 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 10 [2021-11-22 14:34:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:21,886 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2021-11-22 14:34:21,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2021-11-22 14:34:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-22 14:34:21,887 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:21,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:34:21,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 14:34:21,894 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:21,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:21,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1103137848, now seen corresponding path program 1 times [2021-11-22 14:34:21,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:21,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749985213] [2021-11-22 14:34:21,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:21,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:22,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:22,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749985213] [2021-11-22 14:34:22,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749985213] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:22,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:22,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 14:34:22,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052562676] [2021-11-22 14:34:22,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:22,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 14:34:22,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:22,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 14:34:22,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 14:34:22,045 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:22,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:22,203 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2021-11-22 14:34:22,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 14:34:22,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-22 14:34:22,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:22,208 INFO L225 Difference]: With dead ends: 110 [2021-11-22 14:34:22,209 INFO L226 Difference]: Without dead ends: 110 [2021-11-22 14:34:22,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 14:34:22,219 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 235 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:22,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 90 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:34:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-22 14:34:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2021-11-22 14:34:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2021-11-22 14:34:22,236 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2021-11-22 14:34:22,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:22,237 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2021-11-22 14:34:22,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2021-11-22 14:34:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-22 14:34:22,239 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:22,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:34:22,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 14:34:22,240 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:22,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:22,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1103137849, now seen corresponding path program 1 times [2021-11-22 14:34:22,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:22,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935489318] [2021-11-22 14:34:22,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:22,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:22,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:22,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935489318] [2021-11-22 14:34:22,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935489318] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:22,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:22,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 14:34:22,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961084874] [2021-11-22 14:34:22,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:22,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 14:34:22,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:22,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 14:34:22,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 14:34:22,391 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:22,521 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2021-11-22 14:34:22,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 14:34:22,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-22 14:34:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:22,523 INFO L225 Difference]: With dead ends: 89 [2021-11-22 14:34:22,523 INFO L226 Difference]: Without dead ends: 89 [2021-11-22 14:34:22,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 14:34:22,524 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 237 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:22,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 56 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:34:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-22 14:34:22,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2021-11-22 14:34:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 82 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2021-11-22 14:34:22,532 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 16 [2021-11-22 14:34:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:22,532 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2021-11-22 14:34:22,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2021-11-22 14:34:22,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-22 14:34:22,533 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:22,534 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:34:22,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 14:34:22,534 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:22,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:22,535 INFO L85 PathProgramCache]: Analyzing trace with hash -741449383, now seen corresponding path program 1 times [2021-11-22 14:34:22,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:22,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343222990] [2021-11-22 14:34:22,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:22,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:22,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:22,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:22,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343222990] [2021-11-22 14:34:22,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343222990] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:22,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:22,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 14:34:22,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588045329] [2021-11-22 14:34:22,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:22,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:34:22,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:22,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:34:22,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:34:22,664 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:22,810 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2021-11-22 14:34:22,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 14:34:22,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-11-22 14:34:22,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:22,812 INFO L225 Difference]: With dead ends: 114 [2021-11-22 14:34:22,812 INFO L226 Difference]: Without dead ends: 114 [2021-11-22 14:34:22,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:34:22,813 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 303 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:22,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 89 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:34:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-22 14:34:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2021-11-22 14:34:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 91 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2021-11-22 14:34:22,821 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 18 [2021-11-22 14:34:22,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:22,821 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2021-11-22 14:34:22,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2021-11-22 14:34:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-22 14:34:22,823 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:22,823 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:34:22,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 14:34:22,823 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:22,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash -741449382, now seen corresponding path program 1 times [2021-11-22 14:34:22,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:22,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440092571] [2021-11-22 14:34:22,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:22,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:22,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:22,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440092571] [2021-11-22 14:34:22,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440092571] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:22,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:22,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 14:34:22,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694134940] [2021-11-22 14:34:22,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:22,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 14:34:22,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:22,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 14:34:22,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:34:22,980 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:23,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:23,157 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2021-11-22 14:34:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 14:34:23,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-11-22 14:34:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:23,159 INFO L225 Difference]: With dead ends: 113 [2021-11-22 14:34:23,159 INFO L226 Difference]: Without dead ends: 113 [2021-11-22 14:34:23,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-22 14:34:23,160 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 207 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:23,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 102 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:34:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-22 14:34:23,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2021-11-22 14:34:23,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 91 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2021-11-22 14:34:23,172 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 18 [2021-11-22 14:34:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:23,173 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2021-11-22 14:34:23,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2021-11-22 14:34:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-22 14:34:23,174 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:23,174 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:34:23,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 14:34:23,175 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:23,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:23,176 INFO L85 PathProgramCache]: Analyzing trace with hash 431868768, now seen corresponding path program 1 times [2021-11-22 14:34:23,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:23,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914008602] [2021-11-22 14:34:23,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:23,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:23,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:23,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914008602] [2021-11-22 14:34:23,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914008602] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:23,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:23,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 14:34:23,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771428627] [2021-11-22 14:34:23,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:23,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 14:34:23,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:23,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 14:34:23,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 14:34:23,243 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:23,325 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2021-11-22 14:34:23,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 14:34:23,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-22 14:34:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:23,328 INFO L225 Difference]: With dead ends: 93 [2021-11-22 14:34:23,328 INFO L226 Difference]: Without dead ends: 93 [2021-11-22 14:34:23,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 14:34:23,329 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 175 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:23,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 140 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:34:23,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-22 14:34:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2021-11-22 14:34:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.5) internal successors, (99), 91 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2021-11-22 14:34:23,348 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 20 [2021-11-22 14:34:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:23,348 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2021-11-22 14:34:23,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2021-11-22 14:34:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-22 14:34:23,350 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:23,351 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:34:23,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 14:34:23,358 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:23,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:23,359 INFO L85 PathProgramCache]: Analyzing trace with hash 498265101, now seen corresponding path program 1 times [2021-11-22 14:34:23,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:23,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742408067] [2021-11-22 14:34:23,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:23,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:23,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:23,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742408067] [2021-11-22 14:34:23,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742408067] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:34:23,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268414532] [2021-11-22 14:34:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:23,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:34:23,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:34:23,434 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:34:23,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-22 14:34:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:23,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-22 14:34:23,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:34:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:23,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:34:23,722 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-22 14:34:23,723 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 12 treesize of output 11 [2021-11-22 14:34:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:23,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268414532] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:34:23,770 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:34:23,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2021-11-22 14:34:23,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142173000] [2021-11-22 14:34:23,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:34:23,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 14:34:23,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:23,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 14:34:23,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 14:34:23,772 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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-11-22 14:34:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:23,891 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2021-11-22 14:34:23,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 14:34:23,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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 21 [2021-11-22 14:34:23,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:23,896 INFO L225 Difference]: With dead ends: 113 [2021-11-22 14:34:23,896 INFO L226 Difference]: Without dead ends: 113 [2021-11-22 14:34:23,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:34:23,899 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 135 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:23,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 145 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:34:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-22 14:34:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2021-11-22 14:34:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 90 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2021-11-22 14:34:23,909 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 21 [2021-11-22 14:34:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:23,909 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2021-11-22 14:34:23,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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-11-22 14:34:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2021-11-22 14:34:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-22 14:34:23,910 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:23,911 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:34:23,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-22 14:34:24,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-22 14:34:24,126 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:24,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:24,127 INFO L85 PathProgramCache]: Analyzing trace with hash 498265102, now seen corresponding path program 1 times [2021-11-22 14:34:24,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:24,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394867911] [2021-11-22 14:34:24,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:24,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:24,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:24,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394867911] [2021-11-22 14:34:24,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394867911] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:34:24,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008606888] [2021-11-22 14:34:24,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:24,248 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:34:24,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:34:24,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:34:24,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-22 14:34:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:24,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-22 14:34:24,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:34:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:24,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:34:24,502 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:34:24,503 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 19 treesize of output 23 [2021-11-22 14:34:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:24,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008606888] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:34:24,666 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:34:24,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2021-11-22 14:34:24,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227158373] [2021-11-22 14:34:24,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:34:24,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 14:34:24,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:24,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 14:34:24,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-22 14:34:24,668 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:24,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:24,872 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2021-11-22 14:34:24,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 14:34:24,872 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 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 21 [2021-11-22 14:34:24,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:24,873 INFO L225 Difference]: With dead ends: 91 [2021-11-22 14:34:24,873 INFO L226 Difference]: Without dead ends: 91 [2021-11-22 14:34:24,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-11-22 14:34:24,874 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 401 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:24,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 206 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:34:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-11-22 14:34:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2021-11-22 14:34:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 89 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2021-11-22 14:34:24,878 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 21 [2021-11-22 14:34:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:24,878 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2021-11-22 14:34:24,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2021-11-22 14:34:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-22 14:34:24,879 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:24,879 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:34:24,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-22 14:34:25,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-22 14:34:25,086 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:25,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:25,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1733651014, now seen corresponding path program 1 times [2021-11-22 14:34:25,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:25,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145392867] [2021-11-22 14:34:25,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:25,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:25,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:25,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145392867] [2021-11-22 14:34:25,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145392867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:25,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:25,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 14:34:25,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082148994] [2021-11-22 14:34:25,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:25,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:34:25,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:25,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:34:25,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:34:25,149 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-11-22 14:34:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:25,272 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2021-11-22 14:34:25,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 14:34:25,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-11-22 14:34:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:25,274 INFO L225 Difference]: With dead ends: 108 [2021-11-22 14:34:25,274 INFO L226 Difference]: Without dead ends: 108 [2021-11-22 14:34:25,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-22 14:34:25,275 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 285 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:25,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 97 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:34:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-22 14:34:25,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2021-11-22 14:34:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 87 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2021-11-22 14:34:25,280 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 22 [2021-11-22 14:34:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:25,280 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2021-11-22 14:34:25,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-11-22 14:34:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2021-11-22 14:34:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-22 14:34:25,282 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:25,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:34:25,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 14:34:25,283 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:25,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:25,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1733651013, now seen corresponding path program 1 times [2021-11-22 14:34:25,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:25,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872234169] [2021-11-22 14:34:25,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:25,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:25,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:25,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872234169] [2021-11-22 14:34:25,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872234169] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:25,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:25,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 14:34:25,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798798481] [2021-11-22 14:34:25,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:25,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:34:25,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:25,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:34:25,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:34:25,395 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-11-22 14:34:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:25,529 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2021-11-22 14:34:25,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 14:34:25,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-11-22 14:34:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:25,531 INFO L225 Difference]: With dead ends: 86 [2021-11-22 14:34:25,531 INFO L226 Difference]: Without dead ends: 86 [2021-11-22 14:34:25,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-22 14:34:25,532 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 284 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:25,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 50 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:34:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-11-22 14:34:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2021-11-22 14:34:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 84 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2021-11-22 14:34:25,536 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 22 [2021-11-22 14:34:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:25,536 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2021-11-22 14:34:25,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-11-22 14:34:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2021-11-22 14:34:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-22 14:34:25,540 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:25,540 INFO L514 BasicCegarLoop]: trace histogram [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-11-22 14:34:25,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 14:34:25,540 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:25,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1015769950, now seen corresponding path program 1 times [2021-11-22 14:34:25,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:25,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821971087] [2021-11-22 14:34:25,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:25,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:25,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:25,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821971087] [2021-11-22 14:34:25,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821971087] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:25,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:25,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 14:34:25,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10392604] [2021-11-22 14:34:25,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:25,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 14:34:25,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:25,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 14:34:25,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:34:25,635 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:25,905 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2021-11-22 14:34:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 14:34:25,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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 27 [2021-11-22 14:34:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:25,907 INFO L225 Difference]: With dead ends: 153 [2021-11-22 14:34:25,907 INFO L226 Difference]: Without dead ends: 153 [2021-11-22 14:34:25,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-22 14:34:25,908 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 476 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:25,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [476 Valid, 184 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:34:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-11-22 14:34:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 88. [2021-11-22 14:34:25,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2021-11-22 14:34:25,912 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 27 [2021-11-22 14:34:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:25,912 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2021-11-22 14:34:25,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2021-11-22 14:34:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-22 14:34:25,913 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:25,913 INFO L514 BasicCegarLoop]: trace histogram [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-11-22 14:34:25,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 14:34:25,914 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:25,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:25,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1015769949, now seen corresponding path program 1 times [2021-11-22 14:34:25,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:25,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504477867] [2021-11-22 14:34:25,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:25,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:26,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:26,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504477867] [2021-11-22 14:34:26,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504477867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:26,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:26,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 14:34:26,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055318954] [2021-11-22 14:34:26,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:26,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 14:34:26,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:26,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 14:34:26,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:34:26,060 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:26,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:26,379 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2021-11-22 14:34:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 14:34:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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 27 [2021-11-22 14:34:26,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:26,381 INFO L225 Difference]: With dead ends: 134 [2021-11-22 14:34:26,381 INFO L226 Difference]: Without dead ends: 134 [2021-11-22 14:34:26,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-22 14:34:26,382 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 493 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:26,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [493 Valid, 125 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:34:26,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-22 14:34:26,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 88. [2021-11-22 14:34:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.411764705882353) internal successors, (96), 87 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2021-11-22 14:34:26,386 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 27 [2021-11-22 14:34:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:26,386 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2021-11-22 14:34:26,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2021-11-22 14:34:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-22 14:34:26,387 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:26,388 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:34:26,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 14:34:26,388 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:26,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1198576664, now seen corresponding path program 1 times [2021-11-22 14:34:26,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:26,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602089949] [2021-11-22 14:34:26,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:26,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:34:26,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:26,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602089949] [2021-11-22 14:34:26,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602089949] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:26,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:26,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 14:34:26,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001307856] [2021-11-22 14:34:26,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:26,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:34:26,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:26,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:34:26,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:34:26,432 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:26,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:26,448 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2021-11-22 14:34:26,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 14:34:26,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-11-22 14:34:26,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:26,449 INFO L225 Difference]: With dead ends: 117 [2021-11-22 14:34:26,450 INFO L226 Difference]: Without dead ends: 117 [2021-11-22 14:34:26,450 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-11-22 14:34:26,451 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 112 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 151 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-11-22 14:34:26,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 151 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:34:26,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-22 14:34:26,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2021-11-22 14:34:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.4) internal successors, (98), 89 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2021-11-22 14:34:26,454 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 29 [2021-11-22 14:34:26,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:26,454 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2021-11-22 14:34:26,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2021-11-22 14:34:26,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-22 14:34:26,455 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:26,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:34:26,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 14:34:26,456 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:26,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:26,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1538690034, now seen corresponding path program 1 times [2021-11-22 14:34:26,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:26,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605508604] [2021-11-22 14:34:26,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:26,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:34:26,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:26,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605508604] [2021-11-22 14:34:26,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605508604] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:26,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:26,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 14:34:26,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606237288] [2021-11-22 14:34:26,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:26,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:34:26,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:26,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:34:26,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:34:26,494 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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-11-22 14:34:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:26,518 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2021-11-22 14:34:26,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 14:34:26,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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-11-22 14:34:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:26,520 INFO L225 Difference]: With dead ends: 166 [2021-11-22 14:34:26,520 INFO L226 Difference]: Without dead ends: 166 [2021-11-22 14:34:26,521 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-11-22 14:34:26,521 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 98 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:26,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 230 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:34:26,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-22 14:34:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 91. [2021-11-22 14:34:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 90 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2021-11-22 14:34:26,525 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 30 [2021-11-22 14:34:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:26,526 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2021-11-22 14:34:26,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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-11-22 14:34:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2021-11-22 14:34:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 14:34:26,526 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:26,527 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:34:26,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 14:34:26,527 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1258061792, now seen corresponding path program 1 times [2021-11-22 14:34:26,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:26,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199601657] [2021-11-22 14:34:26,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:26,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:34:26,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:26,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199601657] [2021-11-22 14:34:26,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199601657] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:34:26,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:34:26,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 14:34:26,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855055616] [2021-11-22 14:34:26,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:34:26,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 14:34:26,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:26,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 14:34:26,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:34:26,605 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:26,857 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2021-11-22 14:34:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 14:34:26,858 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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-11-22 14:34:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:26,858 INFO L225 Difference]: With dead ends: 116 [2021-11-22 14:34:26,859 INFO L226 Difference]: Without dead ends: 116 [2021-11-22 14:34:26,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-22 14:34:26,860 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 455 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:26,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [455 Valid, 144 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:34:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-22 14:34:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2021-11-22 14:34:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 93 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2021-11-22 14:34:26,864 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 34 [2021-11-22 14:34:26,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:26,864 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2021-11-22 14:34:26,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2021-11-22 14:34:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 14:34:26,867 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:26,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:34:26,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 14:34:26,867 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1258061791, now seen corresponding path program 1 times [2021-11-22 14:34:26,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:26,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054855236] [2021-11-22 14:34:26,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:26,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:34:26,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:26,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054855236] [2021-11-22 14:34:26,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054855236] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:34:26,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826663687] [2021-11-22 14:34:26,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:26,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:34:26,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:34:26,954 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:34:26,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-22 14:34:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:27,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-22 14:34:27,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:34:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:34:27,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:34:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:34:27,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826663687] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:34:27,232 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:34:27,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-11-22 14:34:27,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989763686] [2021-11-22 14:34:27,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:34:27,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 14:34:27,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:27,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 14:34:27,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-11-22 14:34:27,233 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:27,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:27,277 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2021-11-22 14:34:27,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 14:34:27,278 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-22 14:34:27,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:27,283 INFO L225 Difference]: With dead ends: 116 [2021-11-22 14:34:27,283 INFO L226 Difference]: Without dead ends: 116 [2021-11-22 14:34:27,283 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-11-22 14:34:27,285 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 165 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:27,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 202 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:34:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-22 14:34:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2021-11-22 14:34:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 109 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2021-11-22 14:34:27,289 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 34 [2021-11-22 14:34:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:27,289 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2021-11-22 14:34:27,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2021-11-22 14:34:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-22 14:34:27,293 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:27,293 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2021-11-22 14:34:27,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-22 14:34:27,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-22 14:34:27,502 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:27,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:27,502 INFO L85 PathProgramCache]: Analyzing trace with hash -305348934, now seen corresponding path program 1 times [2021-11-22 14:34:27,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:27,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856942529] [2021-11-22 14:34:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:27,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:34:27,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:34:27,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856942529] [2021-11-22 14:34:27,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856942529] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:34:27,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452522280] [2021-11-22 14:34:27,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:27,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:34:27,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:34:27,854 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:34:27,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-22 14:34:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:34:27,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-22 14:34:27,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:34:27,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 14:34:28,002 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 14:34:28,003 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-11-22 14:34:28,131 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 11 treesize of output 7 [2021-11-22 14:34:28,184 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-11-22 14:34:28,353 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-22 14:34:28,354 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 28 treesize of output 30 [2021-11-22 14:34:30,471 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-11-22 14:34:30,471 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 48 treesize of output 41 [2021-11-22 14:34:30,902 INFO L354 Elim1Store]: treesize reduction 138, result has 15.9 percent of original size [2021-11-22 14:34:30,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 47 [2021-11-22 14:34:31,067 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-11-22 14:34:31,068 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 22 [2021-11-22 14:34:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:34:31,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:34:36,362 INFO L354 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2021-11-22 14:34:36,363 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 24 treesize of output 23 [2021-11-22 14:34:54,002 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2021-11-22 14:34:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:34:54,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452522280] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:34:54,168 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:34:54,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 13] total 39 [2021-11-22 14:34:54,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431745102] [2021-11-22 14:34:54,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:34:54,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-22 14:34:54,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:34:54,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-22 14:34:54,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1338, Unknown=24, NotChecked=74, Total=1560 [2021-11-22 14:34:54,170 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:34:59,620 INFO L93 Difference]: Finished difference Result 280 states and 338 transitions. [2021-11-22 14:34:59,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-22 14:34:59,620 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 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 35 [2021-11-22 14:34:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:34:59,623 INFO L225 Difference]: With dead ends: 280 [2021-11-22 14:34:59,624 INFO L226 Difference]: Without dead ends: 280 [2021-11-22 14:34:59,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=258, Invalid=2584, Unknown=24, NotChecked=104, Total=2970 [2021-11-22 14:34:59,626 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 226 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 468 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 14:34:59,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 2654 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 967 Invalid, 0 Unknown, 468 Unchecked, 0.6s Time] [2021-11-22 14:34:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-11-22 14:34:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 133. [2021-11-22 14:34:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 113 states have (on average 1.407079646017699) internal successors, (159), 132 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 159 transitions. [2021-11-22 14:34:59,635 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 159 transitions. Word has length 35 [2021-11-22 14:34:59,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:34:59,636 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 159 transitions. [2021-11-22 14:34:59,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:34:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 159 transitions. [2021-11-22 14:34:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-22 14:34:59,637 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:34:59,637 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2021-11-22 14:34:59,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-22 14:34:59,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:34:59,854 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:34:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:34:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash -305348933, now seen corresponding path program 1 times [2021-11-22 14:34:59,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:34:59,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362090546] [2021-11-22 14:34:59,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:34:59,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:34:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:35:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:35:00,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:35:00,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362090546] [2021-11-22 14:35:00,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362090546] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:35:00,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567568988] [2021-11-22 14:35:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:35:00,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:35:00,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:35:00,416 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:35:00,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-22 14:35:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:35:00,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 68 conjunts are in the unsatisfiable core [2021-11-22 14:35:00,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:35:00,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 14:35:00,736 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 14:35:00,736 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-11-22 14:35:00,746 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-11-22 14:35:01,024 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 11 treesize of output 7 [2021-11-22 14:35:01,031 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 11 treesize of output 7 [2021-11-22 14:35:01,154 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-22 14:35:01,155 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 70 treesize of output 48 [2021-11-22 14:35:01,168 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-22 14:35:01,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2021-11-22 14:35:01,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:35:01,394 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-11-22 14:35:01,395 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 2 case distinctions, treesize of input 76 treesize of output 65 [2021-11-22 14:35:01,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:35:01,417 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-11-22 14:35:01,417 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 2 case distinctions, treesize of input 56 treesize of output 58 [2021-11-22 14:35:01,582 INFO L354 Elim1Store]: treesize reduction 140, result has 17.6 percent of original size [2021-11-22 14:35:01,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 110 [2021-11-22 14:35:01,620 INFO L354 Elim1Store]: treesize reduction 138, result has 16.9 percent of original size [2021-11-22 14:35:01,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 100 [2021-11-22 14:35:02,211 INFO L354 Elim1Store]: treesize reduction 232, result has 13.8 percent of original size [2021-11-22 14:35:02,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 165 treesize of output 125 [2021-11-22 14:35:02,269 INFO L354 Elim1Store]: treesize reduction 256, result has 14.4 percent of original size [2021-11-22 14:35:02,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 146 treesize of output 124 [2021-11-22 14:35:02,558 INFO L354 Elim1Store]: treesize reduction 88, result has 1.1 percent of original size [2021-11-22 14:35:02,558 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 143 treesize of output 82 [2021-11-22 14:35:02,567 INFO L354 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2021-11-22 14:35:02,567 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 41 [2021-11-22 14:35:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:35:02,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:35:05,266 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (and (forall ((v_DerPreprocessor_3 Int)) (<= 0 (+ 8 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_DerPreprocessor_3) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ 12 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_DerPreprocessor_3) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-11-22 14:35:07,304 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (and (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) (forall ((v_DerPreprocessor_3 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8)))))) is different from false [2021-11-22 14:35:09,334 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (and (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_DerPreprocessor_3 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-11-22 14:35:11,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (and (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ 12 (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) .cse1 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_DerPreprocessor_3 Int)) (<= 0 (+ 8 (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-11-22 14:35:20,195 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-11-22 14:35:20,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 215 [2021-11-22 14:35:20,261 INFO L354 Elim1Store]: treesize reduction 72, result has 40.0 percent of original size [2021-11-22 14:35:20,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 215 treesize of output 142 [2021-11-22 14:35:20,282 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:35:20,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 158 [2021-11-22 14:35:20,306 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:35:20,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 172 [2021-11-22 14:35:20,428 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 10 treesize of output 6 [2021-11-22 14:35:20,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-22 14:35:20,562 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 14:35:20,563 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 15 treesize of output 9 [2021-11-22 14:35:20,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 8 treesize of output 4 [2021-11-22 14:35:20,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:35:20,668 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:35:20,696 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:35:20,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 110 [2021-11-22 14:35:21,017 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:35:21,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:35:21,021 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 18 treesize of output 10 [2021-11-22 14:35:21,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:35:21,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:35:21,181 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 20 treesize of output 12 [2021-11-22 14:35:21,467 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:35:21,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:35:21,478 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:35:21,479 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 34 treesize of output 34 [2021-11-22 14:35:21,570 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:35:21,571 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:35:21,575 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-11-22 14:35:21,717 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:35:21,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:35:21,749 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-11-22 14:35:21,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:35:21,808 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:35:21,820 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:35:21,820 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 32 treesize of output 32 [2021-11-22 14:35:22,292 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:35:22,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1950 treesize of output 1486 [2021-11-22 14:35:24,542 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-11-22 14:35:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 14:35:24,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567568988] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:35:24,649 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:35:24,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 56 [2021-11-22 14:35:24,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504749642] [2021-11-22 14:35:24,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:35:24,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-11-22 14:35:24,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:35:24,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-11-22 14:35:24,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2599, Unknown=6, NotChecked=420, Total=3192 [2021-11-22 14:35:24,653 INFO L87 Difference]: Start difference. First operand 133 states and 159 transitions. Second operand has 57 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 57 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:36,120 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (.cse1 (select |c_#length| .cse3)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= .cse1 12) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select .cse0 4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 12) (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (<= 0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= 12 (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse2 4)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 12 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (= (select (store .cse4 .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= 12 (select |c_#length| (select (store .cse5 .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (and (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (.cse8 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ 12 (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) .cse8 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse8 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_DerPreprocessor_3 Int)) (<= 0 (+ 8 (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) 4)) (<= 12 .cse1) (= (select .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from false [2021-11-22 14:35:44,972 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select .cse3 .cse5))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse6 (select |c_#memory_$Pointer$.base| .cse1)) (.cse7 (select .cse2 .cse5))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (and (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_DerPreprocessor_3 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= .cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select .cse4 4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (store .cse2 .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse6 4)) (= 12 (select |c_#length| (select (store .cse3 .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select .cse4 .cse7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 12 (select |c_#length| .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse6 .cse7)) (<= .cse7 0) (<= 0 .cse7))))) is different from false [2021-11-22 14:35:45,722 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse7 (+ |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 4))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse0 (select .cse8 .cse7))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse0)) (.cse3 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse1 (select .cse4 .cse7))) (and (<= 12 (select |c_#length| .cse0)) (<= .cse1 0) (= .cse2 .cse0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| (select .cse3 4)) (= 0 (select .cse4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (= (select |c_#length| .cse2) 12) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select .cse5 .cse1)) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= 12 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select .cse5 4)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| (select .cse3 .cse1)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (and (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse6 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse6 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse6 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) (forall ((v_DerPreprocessor_3 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8)))))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= 0 .cse1))))) is different from false [2021-11-22 14:35:46,458 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select .cse7 .cse8))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse3 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse2 (select .cse5 .cse8)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= 12 (select |c_#length| .cse0)) (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse1 .cse2)) (= (select .cse3 .cse2) |c_ULTIMATE.start_main_~s~0#1.offset|) (<= 0 .cse2) (= (select .cse1 4) |c_ULTIMATE.start_main_~s~0#1.base|) (= (select |c_#length| .cse4) 12) (= (select .cse5 |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (= (select .cse3 4) |c_ULTIMATE.start_main_~s~0#1.offset|) (<= .cse2 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (and (forall ((v_DerPreprocessor_3 Int)) (<= 0 (+ 8 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_DerPreprocessor_3) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse6 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ 12 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse6 v_DerPreprocessor_3) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse6 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= 12 (select |c_#length| |c_ULTIMATE.start_main_~s~0#1.base|)) (= .cse4 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))))) is different from false [2021-11-22 14:35:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:35:49,034 INFO L93 Difference]: Finished difference Result 414 states and 508 transitions. [2021-11-22 14:35:49,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-22 14:35:49,034 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 57 states have internal predecessors, (103), 0 states have call successors, (0), 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 35 [2021-11-22 14:35:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:35:49,037 INFO L225 Difference]: With dead ends: 414 [2021-11-22 14:35:49,037 INFO L226 Difference]: Without dead ends: 414 [2021-11-22 14:35:49,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 41.9s TimeCoverageRelationStatistics Valid=468, Invalid=4810, Unknown=10, NotChecked=1192, Total=6480 [2021-11-22 14:35:49,040 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 811 mSDsluCounter, 2886 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 2977 SdHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1019 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:35:49,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [811 Valid, 2977 Invalid, 2478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1383 Invalid, 0 Unknown, 1019 Unchecked, 1.2s Time] [2021-11-22 14:35:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-11-22 14:35:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 132. [2021-11-22 14:35:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 131 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:49,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2021-11-22 14:35:49,062 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 35 [2021-11-22 14:35:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:35:49,063 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2021-11-22 14:35:49,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 57 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2021-11-22 14:35:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-22 14:35:49,064 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:35:49,064 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2021-11-22 14:35:49,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-22 14:35:49,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:35:49,270 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:35:49,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:35:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash -305348878, now seen corresponding path program 1 times [2021-11-22 14:35:49,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:35:49,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47103328] [2021-11-22 14:35:49,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:35:49,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:35:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:35:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:35:49,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:35:49,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47103328] [2021-11-22 14:35:49,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47103328] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:35:49,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868718525] [2021-11-22 14:35:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:35:49,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:35:49,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:35:49,342 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:35:49,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-22 14:35:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:35:49,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-22 14:35:49,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:35:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:35:49,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:35:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:35:49,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868718525] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:35:49,538 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:35:49,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2021-11-22 14:35:49,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844703593] [2021-11-22 14:35:49,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:35:49,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 14:35:49,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:35:49,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 14:35:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:35:49,540 INFO L87 Difference]: Start difference. First operand 132 states and 157 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-11-22 14:35:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:35:49,600 INFO L93 Difference]: Finished difference Result 172 states and 198 transitions. [2021-11-22 14:35:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 14:35:49,601 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 35 [2021-11-22 14:35:49,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:35:49,602 INFO L225 Difference]: With dead ends: 172 [2021-11-22 14:35:49,603 INFO L226 Difference]: Without dead ends: 172 [2021-11-22 14:35:49,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 69 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-11-22 14:35:49,604 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 142 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:35:49,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 281 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:35:49,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-11-22 14:35:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2021-11-22 14:35:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 139 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2021-11-22 14:35:49,610 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 35 [2021-11-22 14:35:49,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:35:49,610 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2021-11-22 14:35:49,610 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-11-22 14:35:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2021-11-22 14:35:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-22 14:35:49,612 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:35:49,612 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2021-11-22 14:35:49,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-22 14:35:49,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:35:49,826 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:35:49,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:35:49,826 INFO L85 PathProgramCache]: Analyzing trace with hash 397610729, now seen corresponding path program 2 times [2021-11-22 14:35:49,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:35:49,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558123406] [2021-11-22 14:35:49,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:35:49,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:35:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:35:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:35:49,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:35:49,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558123406] [2021-11-22 14:35:49,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558123406] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:35:49,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401180272] [2021-11-22 14:35:49,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-22 14:35:49,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:35:49,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:35:49,918 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:35:49,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-22 14:35:50,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-22 14:35:50,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 14:35:50,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-22 14:35:50,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:35:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 14:35:50,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 14:35:50,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401180272] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:35:50,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-22 14:35:50,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2021-11-22 14:35:50,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084450734] [2021-11-22 14:35:50,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:35:50,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:35:50,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:35:50,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:35:50,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:35:50,185 INFO L87 Difference]: Start difference. First operand 140 states and 167 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:35:50,250 INFO L93 Difference]: Finished difference Result 180 states and 207 transitions. [2021-11-22 14:35:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 14:35:50,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-22 14:35:50,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:35:50,255 INFO L225 Difference]: With dead ends: 180 [2021-11-22 14:35:50,255 INFO L226 Difference]: Without dead ends: 180 [2021-11-22 14:35:50,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-22 14:35:50,256 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 126 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:35:50,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 240 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:35:50,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-11-22 14:35:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 144. [2021-11-22 14:35:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 124 states have (on average 1.3709677419354838) internal successors, (170), 143 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2021-11-22 14:35:50,262 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 39 [2021-11-22 14:35:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:35:50,262 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2021-11-22 14:35:50,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2021-11-22 14:35:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 14:35:50,263 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:35:50,263 INFO L514 BasicCegarLoop]: trace histogram [3, 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-11-22 14:35:50,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-22 14:35:50,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-22 14:35:50,488 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:35:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:35:50,488 INFO L85 PathProgramCache]: Analyzing trace with hash -519108310, now seen corresponding path program 2 times [2021-11-22 14:35:50,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:35:50,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769869799] [2021-11-22 14:35:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:35:50,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:35:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:35:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 14:35:50,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:35:50,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769869799] [2021-11-22 14:35:50,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769869799] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:35:50,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97290899] [2021-11-22 14:35:50,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-22 14:35:50,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:35:50,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:35:50,555 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:35:50,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-22 14:35:50,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-22 14:35:50,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 14:35:50,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-22 14:35:50,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:35:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-22 14:35:50,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:35:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-22 14:35:50,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97290899] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:35:50,915 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:35:50,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-11-22 14:35:50,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555564580] [2021-11-22 14:35:50,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:35:50,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 14:35:50,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:35:50,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 14:35:50,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 14:35:50,917 INFO L87 Difference]: Start difference. First operand 144 states and 170 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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-11-22 14:35:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:35:50,995 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2021-11-22 14:35:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 14:35:50,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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) Word has length 40 [2021-11-22 14:35:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:35:50,997 INFO L225 Difference]: With dead ends: 134 [2021-11-22 14:35:50,997 INFO L226 Difference]: Without dead ends: 134 [2021-11-22 14:35:50,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-11-22 14:35:50,998 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 199 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:35:50,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 332 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:35:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-22 14:35:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 124. [2021-11-22 14:35:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 106 states have (on average 1.349056603773585) 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-11-22 14:35:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2021-11-22 14:35:51,002 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 40 [2021-11-22 14:35:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:35:51,002 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2021-11-22 14:35:51,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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-11-22 14:35:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2021-11-22 14:35:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 14:35:51,003 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:35:51,003 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2021-11-22 14:35:51,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-22 14:35:51,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-22 14:35:51,203 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:35:51,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:35:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1713654537, now seen corresponding path program 1 times [2021-11-22 14:35:51,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:35:51,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687769667] [2021-11-22 14:35:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:35:51,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:35:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:35:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-22 14:35:51,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:35:51,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687769667] [2021-11-22 14:35:51,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687769667] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:35:51,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:35:51,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 14:35:51,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108476222] [2021-11-22 14:35:51,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:35:51,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 14:35:51,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:35:51,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 14:35:51,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:35:51,380 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 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-11-22 14:35:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:35:51,738 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2021-11-22 14:35:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 14:35:51,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 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 42 [2021-11-22 14:35:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:35:51,740 INFO L225 Difference]: With dead ends: 164 [2021-11-22 14:35:51,741 INFO L226 Difference]: Without dead ends: 164 [2021-11-22 14:35:51,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-22 14:35:51,742 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 649 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:35:51,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [649 Valid, 87 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:35:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-22 14:35:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 124. [2021-11-22 14:35:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 123 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 139 transitions. [2021-11-22 14:35:51,747 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 139 transitions. Word has length 42 [2021-11-22 14:35:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:35:51,747 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 139 transitions. [2021-11-22 14:35:51,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 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-11-22 14:35:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2021-11-22 14:35:51,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-22 14:35:51,748 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:35:51,749 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-11-22 14:35:51,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-22 14:35:51,749 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:35:51,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:35:51,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1623544018, now seen corresponding path program 2 times [2021-11-22 14:35:51,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:35:51,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446101543] [2021-11-22 14:35:51,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:35:51,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:35:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:35:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 14:35:51,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:35:51,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446101543] [2021-11-22 14:35:51,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446101543] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:35:51,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763761675] [2021-11-22 14:35:51,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-22 14:35:51,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:35:51,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:35:51,830 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:35:51,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-22 14:35:51,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-22 14:35:51,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 14:35:51,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-22 14:35:51,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:35:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 14:35:52,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 14:35:52,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763761675] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:35:52,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-22 14:35:52,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-11-22 14:35:52,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031619766] [2021-11-22 14:35:52,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:35:52,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:35:52,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:35:52,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:35:52,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-11-22 14:35:52,103 INFO L87 Difference]: Start difference. First operand 124 states and 139 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:52,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:35:52,128 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2021-11-22 14:35:52,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 14:35:52,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-11-22 14:35:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:35:52,129 INFO L225 Difference]: With dead ends: 130 [2021-11-22 14:35:52,129 INFO L226 Difference]: Without dead ends: 130 [2021-11-22 14:35:52,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 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-11-22 14:35:52,130 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 149 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:35:52,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 176 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:35:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-22 14:35:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2021-11-22 14:35:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 123 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-11-22 14:35:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2021-11-22 14:35:52,134 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 43 [2021-11-22 14:35:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:35:52,134 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2021-11-22 14:35:52,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2021-11-22 14:35:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-22 14:35:52,135 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:35:52,135 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:35:52,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-22 14:35:52,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-22 14:35:52,346 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:35:52,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:35:52,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1502739343, now seen corresponding path program 1 times [2021-11-22 14:35:52,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:35:52,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561433426] [2021-11-22 14:35:52,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:35:52,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:35:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:35:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-22 14:35:52,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:35:52,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561433426] [2021-11-22 14:35:52,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561433426] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:35:52,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:35:52,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 14:35:52,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384671624] [2021-11-22 14:35:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:35:52,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:35:52,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:35:52,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:35:52,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:35:52,389 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:35:52,413 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2021-11-22 14:35:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 14:35:52,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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 45 [2021-11-22 14:35:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:35:52,419 INFO L225 Difference]: With dead ends: 121 [2021-11-22 14:35:52,420 INFO L226 Difference]: Without dead ends: 121 [2021-11-22 14:35:52,420 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-11-22 14:35:52,422 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 19 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 224 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-11-22 14:35:52,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 224 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:35:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-22 14:35:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2021-11-22 14:35:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 101 states have (on average 1.2475247524752475) internal successors, (126), 118 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-11-22 14:35:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2021-11-22 14:35:52,442 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 45 [2021-11-22 14:35:52,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:35:52,442 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2021-11-22 14:35:52,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:52,443 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2021-11-22 14:35:52,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-22 14:35:52,443 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:35:52,443 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, 1, 1, 1] [2021-11-22 14:35:52,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-22 14:35:52,444 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:35:52,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:35:52,444 INFO L85 PathProgramCache]: Analyzing trace with hash -961318167, now seen corresponding path program 1 times [2021-11-22 14:35:52,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:35:52,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451759359] [2021-11-22 14:35:52,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:35:52,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:35:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:35:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 14:35:52,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:35:52,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451759359] [2021-11-22 14:35:52,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451759359] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:35:52,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412618817] [2021-11-22 14:35:52,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:35:52,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:35:52,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:35:52,485 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:35:52,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-22 14:35:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:35:52,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-22 14:35:52,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:35:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 14:35:52,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 14:35:52,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412618817] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:35:52,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-22 14:35:52,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-22 14:35:52,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393937760] [2021-11-22 14:35:52,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:35:52,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:35:52,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:35:52,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:35:52,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 14:35:52,658 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:52,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:35:52,665 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-11-22 14:35:52,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 14:35:52,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 45 [2021-11-22 14:35:52,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:35:52,666 INFO L225 Difference]: With dead ends: 91 [2021-11-22 14:35:52,667 INFO L226 Difference]: Without dead ends: 91 [2021-11-22 14:35:52,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-11-22 14:35:52,667 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 118 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:35:52,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:35:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-11-22 14:35:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-11-22 14:35:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 90 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:52,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2021-11-22 14:35:52,671 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 45 [2021-11-22 14:35:52,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:35:52,671 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2021-11-22 14:35:52,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:35:52,671 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2021-11-22 14:35:52,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-22 14:35:52,672 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:35:52,672 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:35:52,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-22 14:35:52,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-22 14:35:52,894 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:35:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:35:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash -710290918, now seen corresponding path program 1 times [2021-11-22 14:35:52,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:35:52,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071133918] [2021-11-22 14:35:52,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:35:52,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:35:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:35:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:35:53,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:35:53,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071133918] [2021-11-22 14:35:53,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071133918] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:35:53,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172839090] [2021-11-22 14:35:53,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:35:53,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:35:53,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:35:53,981 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:35:53,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-22 14:35:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:35:54,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 87 conjunts are in the unsatisfiable core [2021-11-22 14:35:54,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:35:54,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 14:35:54,239 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 14:35:54,239 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-11-22 14:35:54,442 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 11 treesize of output 7 [2021-11-22 14:35:54,524 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-11-22 14:35:54,714 INFO L354 Elim1Store]: treesize reduction 60, result has 22.1 percent of original size [2021-11-22 14:35:54,715 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 44 treesize of output 37 [2021-11-22 14:35:54,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:35:54,794 INFO L354 Elim1Store]: treesize reduction 49, result has 15.5 percent of original size [2021-11-22 14:35:54,794 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 2 case distinctions, treesize of input 46 treesize of output 39 [2021-11-22 14:35:55,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-22 14:35:55,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:35:55,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:35:55,147 INFO L354 Elim1Store]: treesize reduction 69, result has 11.5 percent of original size [2021-11-22 14:35:55,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 37 [2021-11-22 14:35:55,431 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-11-22 14:35:55,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 17 [2021-11-22 14:35:55,601 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-22 14:35:55,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-11-22 14:35:55,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 15 treesize of output 7 [2021-11-22 14:35:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:35:55,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:35:56,791 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_update_at_~data#1| Int) (|ULTIMATE.start_dll_circular_update_at_~head#1.offset| Int)) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |ULTIMATE.start_dll_circular_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2021-11-22 14:35:57,472 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_update_at_~data#1| Int) (|ULTIMATE.start_dll_circular_update_at_~head#1.offset| Int)) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) (+ 8 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |ULTIMATE.start_dll_circular_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2021-11-22 14:36:19,968 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 132 treesize of output 126 [2021-11-22 14:36:29,223 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_DerPreprocessor_4 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-11-22 14:36:29,269 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-11-22 14:36:29,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 50 [2021-11-22 14:36:29,296 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-11-22 14:36:29,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2021-11-22 14:36:29,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-22 14:36:29,364 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-11-22 14:36:29,400 INFO L354 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2021-11-22 14:36:29,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 71 [2021-11-22 14:36:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-22 14:36:29,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172839090] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:36:29,831 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:36:29,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 25] total 67 [2021-11-22 14:36:29,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085962311] [2021-11-22 14:36:29,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:36:29,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2021-11-22 14:36:29,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:36:29,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-11-22 14:36:29,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3792, Unknown=36, NotChecked=378, Total=4422 [2021-11-22 14:36:29,835 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 67 states, 67 states have (on average 1.8507462686567164) internal successors, (124), 67 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:36:33,169 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2021-11-22 14:36:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-22 14:36:33,170 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.8507462686567164) internal successors, (124), 67 states have internal predecessors, (124), 0 states have call successors, (0), 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 46 [2021-11-22 14:36:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:36:33,171 INFO L225 Difference]: With dead ends: 91 [2021-11-22 14:36:33,171 INFO L226 Difference]: Without dead ends: 91 [2021-11-22 14:36:33,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=511, Invalid=6774, Unknown=37, NotChecked=510, Total=7832 [2021-11-22 14:36:33,175 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 234 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 517 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 14:36:33,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 1602 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 722 Invalid, 0 Unknown, 517 Unchecked, 0.5s Time] [2021-11-22 14:36:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-11-22 14:36:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-11-22 14:36:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 90 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2021-11-22 14:36:33,179 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 46 [2021-11-22 14:36:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:36:33,180 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2021-11-22 14:36:33,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.8507462686567164) internal successors, (124), 67 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2021-11-22 14:36:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-22 14:36:33,181 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:36:33,181 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:36:33,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-22 14:36:33,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-22 14:36:33,406 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:36:33,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:36:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1056798014, now seen corresponding path program 1 times [2021-11-22 14:36:33,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:36:33,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028316415] [2021-11-22 14:36:33,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:33,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:36:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:36:34,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:36:34,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028316415] [2021-11-22 14:36:34,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028316415] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:36:34,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196031606] [2021-11-22 14:36:34,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:34,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:36:34,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:36:34,018 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:36:34,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-22 14:36:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:34,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 64 conjunts are in the unsatisfiable core [2021-11-22 14:36:34,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:36:34,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 14:36:34,165 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 14:36:34,165 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-11-22 14:36:34,311 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 11 treesize of output 7 [2021-11-22 14:36:34,373 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-22 14:36:34,373 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 37 treesize of output 27 [2021-11-22 14:36:34,506 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-22 14:36:34,506 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 28 treesize of output 30 [2021-11-22 14:36:34,575 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-11-22 14:36:34,575 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 39 treesize of output 36 [2021-11-22 14:36:34,942 INFO L354 Elim1Store]: treesize reduction 138, result has 15.9 percent of original size [2021-11-22 14:36:34,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 42 [2021-11-22 14:36:35,242 INFO L354 Elim1Store]: treesize reduction 148, result has 17.8 percent of original size [2021-11-22 14:36:35,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 68 [2021-11-22 14:36:35,484 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 14:36:35,485 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 42 treesize of output 16 [2021-11-22 14:36:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 14:36:35,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:36:35,566 INFO L354 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2021-11-22 14:36:35,569 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 26 treesize of output 25 [2021-11-22 14:36:48,400 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 Int) (|ULTIMATE.start_dll_circular_update_at_~head#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) (+ 8 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_5)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-11-22 14:37:02,063 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-11-22 14:37:04,087 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2))) (store .cse1 .cse0 (store (select .cse1 .cse0) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2021-11-22 14:37:06,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2))) (store .cse1 .cse0 (store (select .cse1 .cse0) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2021-11-22 14:37:08,134 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (let ((.cse2 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse1))))) is different from false [2021-11-22 14:37:10,158 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse3 (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse1)))))) is different from false [2021-11-22 14:37:12,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse3 (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3))) (store .cse1 .cse0 (store (select .cse1 .cse0) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2021-11-22 14:37:14,236 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse3 (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3))) (store .cse1 .cse0 (store (select .cse1 .cse0) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) is different from false [2021-11-22 14:37:14,344 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-11-22 14:37:14,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 10821 treesize of output 3177 [2021-11-22 14:37:14,466 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-11-22 14:37:14,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1495 treesize of output 1389 [2021-11-22 14:37:14,517 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-11-22 14:37:20,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-22 14:37:20,159 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:37:20,159 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 23 treesize of output 27 [2021-11-22 14:37:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 2 times theorem prover too weak. 1 trivial. 3 not checked. [2021-11-22 14:37:20,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196031606] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:37:20,512 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:37:20,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 23] total 56 [2021-11-22 14:37:20,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529320981] [2021-11-22 14:37:20,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:37:20,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-11-22 14:37:20,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:37:20,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-11-22 14:37:20,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2184, Unknown=31, NotChecked=808, Total=3192 [2021-11-22 14:37:20,516 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand has 57 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 57 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:22,937 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse3 (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3))) (store .cse1 .cse0 (store (select .cse1 .cse0) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (= .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_node_create_#res#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse5) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1))) is different from false [2021-11-22 14:37:24,956 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse3 (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3))) (store .cse1 .cse0 (store (select .cse1 .cse0) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (= .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse5) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) is different from false [2021-11-22 14:37:26,979 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse3 (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3))) (store .cse1 .cse0 (store (select .cse1 .cse0) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-11-22 14:37:28,930 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| Int)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse4 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse4))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse2)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-22 14:37:30,936 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (let ((.cse4 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse4))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse3))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| Int)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from false [2021-11-22 14:37:32,942 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse5 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (.cse1 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| .cse1) 1) (= .cse0 .cse1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse2 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse4))) (store .cse3 .cse2 (store (select .cse3 .cse2) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))))) is different from false [2021-11-22 14:37:34,947 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse1 (select .cse5 (+ |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 4)))) (and (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| Int)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 4))) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| 4)))) (= .cse0 .cse1) (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= .cse2 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse4))) (store .cse3 .cse2 (store (select .cse3 .cse2) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))) is different from false [2021-11-22 14:37:36,952 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (select .cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27| Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_6))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_27|) v_DerPreprocessor_5))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= .cse3 |c_ULTIMATE.start_main_~s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| Int)) (= (select (select |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_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= .cse4 |c_ULTIMATE.start_main_~s~0#1.base|)) (= (select |c_#valid| .cse3) 1) (= .cse3 .cse4) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-11-22 14:37:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:37:37,962 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2021-11-22 14:37:37,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-22 14:37:37,963 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 57 states have internal predecessors, (130), 0 states have call successors, (0), 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-11-22 14:37:37,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:37:37,964 INFO L225 Difference]: With dead ends: 150 [2021-11-22 14:37:37,965 INFO L226 Difference]: Without dead ends: 150 [2021-11-22 14:37:37,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 56.7s TimeCoverageRelationStatistics Valid=329, Invalid=3478, Unknown=39, NotChecked=2160, Total=6006 [2021-11-22 14:37:37,968 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 359 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1217 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 14:37:37,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 1268 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 757 Invalid, 0 Unknown, 1217 Unchecked, 0.6s Time] [2021-11-22 14:37:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-22 14:37:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 95. [2021-11-22 14:37:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 94 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2021-11-22 14:37:37,973 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 52 [2021-11-22 14:37:37,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:37:37,974 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2021-11-22 14:37:37,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 57 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2021-11-22 14:37:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-22 14:37:37,975 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:37:37,975 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:37:38,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-22 14:37:38,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-22 14:37:38,202 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:37:38,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:37:38,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1056798013, now seen corresponding path program 1 times [2021-11-22 14:37:38,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:37:38,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463368058] [2021-11-22 14:37:38,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:37:38,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:37:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:37:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:37:39,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:37:39,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463368058] [2021-11-22 14:37:39,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463368058] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:37:39,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238486491] [2021-11-22 14:37:39,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:37:39,232 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:37:39,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:37:39,233 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:37:39,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-22 14:37:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:37:39,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 73 conjunts are in the unsatisfiable core [2021-11-22 14:37:39,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:37:39,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 14:37:39,453 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 14:37:39,453 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-11-22 14:37:39,592 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 11 treesize of output 7 [2021-11-22 14:37:39,668 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-22 14:37:39,669 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 37 treesize of output 27 [2021-11-22 14:37:39,828 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-11-22 14:37:39,829 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 40 treesize of output 37 [2021-11-22 14:37:39,916 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-11-22 14:37:39,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 36 [2021-11-22 14:37:40,285 INFO L354 Elim1Store]: treesize reduction 138, result has 15.9 percent of original size [2021-11-22 14:37:40,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 42 [2021-11-22 14:37:40,673 INFO L354 Elim1Store]: treesize reduction 180, result has 16.7 percent of original size [2021-11-22 14:37:40,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 122 [2021-11-22 14:37:40,689 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-22 14:37:40,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 94 [2021-11-22 14:37:40,996 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 14:37:40,996 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 62 treesize of output 38 [2021-11-22 14:37:40,999 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 32 treesize of output 20 [2021-11-22 14:37:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 14:37:41,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:37:41,387 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:37:41,388 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 63 treesize of output 67 [2021-11-22 14:37:41,762 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:37:41,762 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 152 treesize of output 123 [2021-11-22 14:37:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 14:37:44,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238486491] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:37:44,476 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:37:44,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 61 [2021-11-22 14:37:44,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731837820] [2021-11-22 14:37:44,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:37:44,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-11-22 14:37:44,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:37:44,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-11-22 14:37:44,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=3576, Unknown=1, NotChecked=0, Total=3782 [2021-11-22 14:37:44,479 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 62 states, 61 states have (on average 2.4754098360655736) internal successors, (151), 62 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:47,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:37:47,386 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2021-11-22 14:37:47,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-22 14:37:47,386 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.4754098360655736) internal successors, (151), 62 states have internal predecessors, (151), 0 states have call successors, (0), 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-11-22 14:37:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:37:47,388 INFO L225 Difference]: With dead ends: 162 [2021-11-22 14:37:47,388 INFO L226 Difference]: Without dead ends: 162 [2021-11-22 14:37:47,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=495, Invalid=6310, Unknown=1, NotChecked=0, Total=6806 [2021-11-22 14:37:47,392 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 533 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 2424 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 14:37:47,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 2424 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 950 Invalid, 0 Unknown, 342 Unchecked, 0.7s Time] [2021-11-22 14:37:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-22 14:37:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 94. [2021-11-22 14:37:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 93 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2021-11-22 14:37:47,397 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 52 [2021-11-22 14:37:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:37:47,398 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-11-22 14:37:47,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.4754098360655736) internal successors, (151), 62 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2021-11-22 14:37:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-22 14:37:47,399 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:37:47,399 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2021-11-22 14:37:47,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-22 14:37:47,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:37:47,613 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:37:47,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:37:47,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1548429639, now seen corresponding path program 1 times [2021-11-22 14:37:47,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:37:47,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83049793] [2021-11-22 14:37:47,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:37:47,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:37:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:37:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-22 14:37:47,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:37:47,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83049793] [2021-11-22 14:37:47,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83049793] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:37:47,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169586402] [2021-11-22 14:37:47,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:37:47,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:37:47,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:37:47,687 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:37:47,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-22 14:37:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:37:47,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-22 14:37:47,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:37:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-22 14:37:47,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:37:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-22 14:37:47,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169586402] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:37:47,974 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:37:47,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2021-11-22 14:37:47,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742140676] [2021-11-22 14:37:47,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:37:47,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:37:47,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:37:47,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:37:47,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:37:47,976 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:37:48,030 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2021-11-22 14:37:48,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 14:37:48,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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 53 [2021-11-22 14:37:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:37:48,036 INFO L225 Difference]: With dead ends: 94 [2021-11-22 14:37:48,037 INFO L226 Difference]: Without dead ends: 94 [2021-11-22 14:37:48,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 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-11-22 14:37:48,038 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 59 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:37:48,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 270 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:37:48,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-22 14:37:48,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-11-22 14:37:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 93 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2021-11-22 14:37:48,044 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 53 [2021-11-22 14:37:48,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:37:48,044 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2021-11-22 14:37:48,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2021-11-22 14:37:48,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-22 14:37:48,046 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:37:48,046 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:37:48,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-22 14:37:48,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:37:48,270 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:37:48,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:37:48,271 INFO L85 PathProgramCache]: Analyzing trace with hash -957617771, now seen corresponding path program 2 times [2021-11-22 14:37:48,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:37:48,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877028650] [2021-11-22 14:37:48,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:37:48,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:37:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:37:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-22 14:37:48,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:37:48,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877028650] [2021-11-22 14:37:48,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877028650] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:37:48,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94408192] [2021-11-22 14:37:48,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-22 14:37:48,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:37:48,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:37:48,353 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:37:48,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-22 14:37:48,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-22 14:37:48,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 14:37:48,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-22 14:37:48,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:37:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-22 14:37:48,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:37:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-22 14:37:48,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94408192] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:37:48,821 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:37:48,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-11-22 14:37:48,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098922152] [2021-11-22 14:37:48,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:37:48,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 14:37:48,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:37:48,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 14:37:48,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:37:48,823 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:37:48,902 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2021-11-22 14:37:48,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 14:37:48,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 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 55 [2021-11-22 14:37:48,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:37:48,903 INFO L225 Difference]: With dead ends: 85 [2021-11-22 14:37:48,903 INFO L226 Difference]: Without dead ends: 85 [2021-11-22 14:37:48,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-11-22 14:37:48,904 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 142 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:37:48,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 160 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:37:48,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-22 14:37:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-11-22 14:37:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.178082191780822) internal successors, (86), 84 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2021-11-22 14:37:48,908 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 55 [2021-11-22 14:37:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:37:48,908 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2021-11-22 14:37:48,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2021-11-22 14:37:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-22 14:37:48,910 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:37:48,910 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:37:48,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-22 14:37:49,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:37:49,118 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:37:49,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:37:49,118 INFO L85 PathProgramCache]: Analyzing trace with hash 328049876, now seen corresponding path program 1 times [2021-11-22 14:37:49,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:37:49,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880161729] [2021-11-22 14:37:49,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:37:49,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:37:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:37:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:37:50,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:37:50,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880161729] [2021-11-22 14:37:50,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880161729] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:37:50,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703083894] [2021-11-22 14:37:50,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:37:50,596 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:37:50,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:37:50,598 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:37:50,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-22 14:37:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:37:50,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 100 conjunts are in the unsatisfiable core [2021-11-22 14:37:50,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:37:50,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 14:37:50,873 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 14:37:50,873 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-11-22 14:37:51,120 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 11 treesize of output 7 [2021-11-22 14:37:51,218 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-11-22 14:37:51,402 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-22 14:37:51,402 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 28 treesize of output 30 [2021-11-22 14:37:51,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:37:51,499 INFO L354 Elim1Store]: treesize reduction 49, result has 15.5 percent of original size [2021-11-22 14:37:51,500 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 2 case distinctions, treesize of input 39 treesize of output 36 [2021-11-22 14:37:51,935 INFO L354 Elim1Store]: treesize reduction 120, result has 16.7 percent of original size [2021-11-22 14:37:51,935 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 6 case distinctions, treesize of input 55 treesize of output 40 [2021-11-22 14:37:52,561 INFO L354 Elim1Store]: treesize reduction 229, result has 13.9 percent of original size [2021-11-22 14:37:52,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 138 treesize of output 122 [2021-11-22 14:37:52,570 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 109 treesize of output 101 [2021-11-22 14:37:52,584 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-22 14:37:52,584 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 101 treesize of output 87 [2021-11-22 14:37:53,158 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:37:53,158 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 51 treesize of output 31 [2021-11-22 14:37:53,161 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 25 treesize of output 17 [2021-11-22 14:37:53,314 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 19 treesize of output 7 [2021-11-22 14:37:53,419 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:37:53,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:37:53,962 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 106 treesize of output 92 [2021-11-22 14:37:54,438 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:37:54,438 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 56 treesize of output 47 [2021-11-22 14:37:54,490 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 33 treesize of output 29 [2021-11-22 14:37:56,919 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_DerPreprocessor_12 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_DerPreprocessor_12) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-11-22 14:37:58,933 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (forall ((v_DerPreprocessor_12 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_DerPreprocessor_12) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2021-11-22 14:37:59,611 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_DerPreprocessor_12) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2021-11-22 14:38:00,379 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_DerPreprocessor_12) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-11-22 14:38:01,671 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_DerPreprocessor_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2021-11-22 14:38:37,751 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-11-22 14:38:37,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 58 [2021-11-22 14:38:37,774 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-11-22 14:38:37,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 66 [2021-11-22 14:38:37,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-22 14:38:37,866 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-11-22 14:38:37,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:38:37,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:38:37,899 INFO L354 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2021-11-22 14:38:37,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 53 [2021-11-22 14:38:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-22 14:38:39,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703083894] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:38:39,956 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:38:39,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 30] total 77 [2021-11-22 14:38:39,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432792155] [2021-11-22 14:38:39,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:38:39,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2021-11-22 14:38:39,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:38:39,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-11-22 14:38:39,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=4885, Unknown=25, NotChecked=720, Total=5852 [2021-11-22 14:38:39,960 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 77 states, 77 states have (on average 2.012987012987013) internal successors, (155), 77 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:38:41,740 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_45| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_45| 4)))) (forall ((v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_DerPreprocessor_12) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store .cse0 .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-22 14:38:42,384 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select .cse0 .cse1) .cse2) (= (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (forall ((v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_DerPreprocessor_12) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_45| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_45| 4)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store .cse0 .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2021-11-22 14:38:43,032 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 0))) (and (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (not (= (select .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_45| Int)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_45| 4)))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (forall ((v_DerPreprocessor_12 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_DerPreprocessor_12) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= .cse0 (select .cse1 4))))) is different from false [2021-11-22 14:38:43,623 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 0))) (and (= .cse0 (select .cse1 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_DerPreprocessor_12 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_DerPreprocessor_12) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_main_~s~0#1.offset|))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_45| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 0)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_45| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-11-22 14:38:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:38:46,185 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2021-11-22 14:38:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-22 14:38:46,185 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 2.012987012987013) internal successors, (155), 77 states have internal predecessors, (155), 0 states have call successors, (0), 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-11-22 14:38:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:38:46,186 INFO L225 Difference]: With dead ends: 83 [2021-11-22 14:38:46,186 INFO L226 Difference]: Without dead ends: 83 [2021-11-22 14:38:46,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 62 SyntacticMatches, 14 SemanticMatches, 103 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 54.2s TimeCoverageRelationStatistics Valid=569, Invalid=8558, Unknown=29, NotChecked=1764, Total=10920 [2021-11-22 14:38:46,190 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 354 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 711 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 14:38:46,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 1495 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 923 Invalid, 0 Unknown, 711 Unchecked, 0.6s Time] [2021-11-22 14:38:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-11-22 14:38:46,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-11-22 14:38:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 82 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:38:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2021-11-22 14:38:46,193 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 56 [2021-11-22 14:38:46,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:38:46,193 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2021-11-22 14:38:46,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 2.012987012987013) internal successors, (155), 77 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:38:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2021-11-22 14:38:46,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-22 14:38:46,195 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:38:46,195 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:38:46,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-22 14:38:46,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-22 14:38:46,402 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:38:46,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:38:46,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1729284278, now seen corresponding path program 1 times [2021-11-22 14:38:46,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:38:46,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435440398] [2021-11-22 14:38:46,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:38:46,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:38:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:38:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-22 14:38:46,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:38:46,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435440398] [2021-11-22 14:38:46,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435440398] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:38:46,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696873927] [2021-11-22 14:38:46,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:38:46,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:38:46,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:38:46,464 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:38:46,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-22 14:38:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:38:46,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-22 14:38:46,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:38:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-22 14:38:46,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 14:38:46,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696873927] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:38:46,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-22 14:38:46,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2021-11-22 14:38:46,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742206094] [2021-11-22 14:38:46,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:38:46,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 14:38:46,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:38:46,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 14:38:46,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 14:38:46,765 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:38:46,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:38:46,967 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2021-11-22 14:38:46,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 14:38:46,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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 60 [2021-11-22 14:38:46,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:38:46,969 INFO L225 Difference]: With dead ends: 101 [2021-11-22 14:38:46,969 INFO L226 Difference]: Without dead ends: 101 [2021-11-22 14:38:46,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-22 14:38:46,970 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 184 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:38:46,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 154 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:38:46,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-22 14:38:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2021-11-22 14:38:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 85 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:38:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2021-11-22 14:38:46,974 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 60 [2021-11-22 14:38:46,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:38:46,974 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2021-11-22 14:38:46,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:38:46,974 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2021-11-22 14:38:46,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-22 14:38:46,975 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:38:46,975 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:38:47,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-22 14:38:47,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-22 14:38:47,176 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:38:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:38:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1729284277, now seen corresponding path program 1 times [2021-11-22 14:38:47,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:38:47,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763876351] [2021-11-22 14:38:47,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:38:47,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:38:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:38:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-22 14:38:47,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:38:47,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763876351] [2021-11-22 14:38:47,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763876351] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:38:47,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:38:47,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 14:38:47,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4334015] [2021-11-22 14:38:47,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:38:47,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 14:38:47,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:38:47,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 14:38:47,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:38:47,328 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:38:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:38:47,633 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2021-11-22 14:38:47,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 14:38:47,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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 60 [2021-11-22 14:38:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:38:47,634 INFO L225 Difference]: With dead ends: 84 [2021-11-22 14:38:47,634 INFO L226 Difference]: Without dead ends: 84 [2021-11-22 14:38:47,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-22 14:38:47,635 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 314 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:38:47,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 47 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:38:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-22 14:38:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-11-22 14:38:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.144736842105263) internal successors, (87), 83 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-11-22 14:38:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2021-11-22 14:38:47,638 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 60 [2021-11-22 14:38:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:38:47,639 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2021-11-22 14:38:47,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:38:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2021-11-22 14:38:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-22 14:38:47,640 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:38:47,640 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:38:47,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-22 14:38:47,641 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:38:47,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:38:47,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2068171144, now seen corresponding path program 1 times [2021-11-22 14:38:47,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:38:47,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312298620] [2021-11-22 14:38:47,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:38:47,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:38:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:38:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-22 14:38:47,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:38:47,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312298620] [2021-11-22 14:38:47,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312298620] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:38:47,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:38:47,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 14:38:47,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899771402] [2021-11-22 14:38:47,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:38:47,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 14:38:47,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:38:47,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 14:38:47,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:38:47,738 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:38:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:38:47,887 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2021-11-22 14:38:47,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 14:38:47,887 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-22 14:38:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:38:47,888 INFO L225 Difference]: With dead ends: 84 [2021-11-22 14:38:47,888 INFO L226 Difference]: Without dead ends: 84 [2021-11-22 14:38:47,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-22 14:38:47,889 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 309 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:38:47,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 71 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:38:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-22 14:38:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-11-22 14:38:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.131578947368421) internal successors, (86), 83 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:38:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2021-11-22 14:38:47,891 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 61 [2021-11-22 14:38:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:38:47,892 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2021-11-22 14:38:47,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:38:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2021-11-22 14:38:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-22 14:38:47,893 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:38:47,893 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:38:47,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-22 14:38:47,893 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:38:47,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:38:47,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1024916022, now seen corresponding path program 1 times [2021-11-22 14:38:47,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:38:47,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323356061] [2021-11-22 14:38:47,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:38:47,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:38:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:38:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-22 14:38:47,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:38:47,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323356061] [2021-11-22 14:38:47,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323356061] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:38:47,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996358528] [2021-11-22 14:38:47,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:38:47,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:38:47,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:38:48,002 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:38:48,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-22 14:38:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:38:48,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-22 14:38:48,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:38:48,584 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 23 treesize of output 15 [2021-11-22 14:38:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-22 14:38:48,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:38:48,738 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-11-22 14:38:48,738 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 16 treesize of output 15 [2021-11-22 14:38:48,832 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-22 14:38:48,833 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 11 treesize of output 11 [2021-11-22 14:38:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-22 14:38:48,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996358528] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:38:48,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:38:48,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 8] total 24 [2021-11-22 14:38:48,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314968234] [2021-11-22 14:38:48,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:38:48,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-22 14:38:48,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:38:48,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-22 14:38:48,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2021-11-22 14:38:48,955 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 25 states, 24 states have (on average 4.958333333333333) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:38:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:38:49,679 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2021-11-22 14:38:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 14:38:49,680 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.958333333333333) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-22 14:38:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:38:49,681 INFO L225 Difference]: With dead ends: 92 [2021-11-22 14:38:49,681 INFO L226 Difference]: Without dead ends: 92 [2021-11-22 14:38:49,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=1193, Unknown=0, NotChecked=0, Total=1482 [2021-11-22 14:38:49,683 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 510 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 14:38:49,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 306 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 14:38:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-22 14:38:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2021-11-22 14:38:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.12987012987013) internal successors, (87), 83 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-11-22 14:38:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2021-11-22 14:38:49,687 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 63 [2021-11-22 14:38:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:38:49,687 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2021-11-22 14:38:49,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.958333333333333) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:38:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2021-11-22 14:38:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-22 14:38:49,688 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:38:49,689 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:38:49,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-22 14:38:49,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-11-22 14:38:49,908 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:38:49,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:38:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1024916023, now seen corresponding path program 1 times [2021-11-22 14:38:49,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:38:49,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632197012] [2021-11-22 14:38:49,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:38:49,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:38:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:38:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:38:50,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:38:50,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632197012] [2021-11-22 14:38:50,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632197012] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:38:50,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037722138] [2021-11-22 14:38:50,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:38:50,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:38:50,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:38:50,847 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:38:50,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-22 14:38:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:38:50,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-22 14:38:50,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:38:50,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 14:38:51,047 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 14:38:51,048 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-11-22 14:38:51,222 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 11 treesize of output 7 [2021-11-22 14:38:51,227 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 11 treesize of output 7 [2021-11-22 14:38:51,306 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 0 case distinctions, treesize of input 61 treesize of output 43 [2021-11-22 14:38:51,309 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 53 treesize of output 48 [2021-11-22 14:38:51,467 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-11-22 14:38:51,468 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 3 case distinctions, treesize of input 67 treesize of output 60 [2021-11-22 14:38:51,487 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-22 14:38:51,488 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 3 case distinctions, treesize of input 51 treesize of output 57 [2021-11-22 14:38:51,613 INFO L354 Elim1Store]: treesize reduction 118, result has 23.4 percent of original size [2021-11-22 14:38:51,614 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 6 case distinctions, treesize of input 94 treesize of output 105 [2021-11-22 14:38:51,658 INFO L354 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2021-11-22 14:38:51,659 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 6 case distinctions, treesize of input 105 treesize of output 93 [2021-11-22 14:38:52,708 INFO L354 Elim1Store]: treesize reduction 208, result has 19.1 percent of original size [2021-11-22 14:38:52,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 158 treesize of output 136 [2021-11-22 14:38:52,763 INFO L354 Elim1Store]: treesize reduction 162, result has 24.7 percent of original size [2021-11-22 14:38:52,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 124 treesize of output 130 [2021-11-22 14:39:02,226 INFO L354 Elim1Store]: treesize reduction 94, result has 19.7 percent of original size [2021-11-22 14:39:02,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 168 treesize of output 160 [2021-11-22 14:39:04,790 INFO L354 Elim1Store]: treesize reduction 132, result has 39.2 percent of original size [2021-11-22 14:39:04,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 157 treesize of output 161 [2021-11-22 14:39:44,897 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 231 treesize of output 223 [2021-11-22 14:39:44,949 INFO L354 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2021-11-22 14:39:44,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 223 treesize of output 173 [2021-11-22 14:39:45,485 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:39:45,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:39:45,911 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:39:45,911 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 31 treesize of output 35 [2021-11-22 14:39:46,181 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:39:46,181 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 36 treesize of output 39 [2021-11-22 14:40:39,472 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 23422 treesize of output 23390 [2021-11-22 14:40:39,583 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-11-22 14:40:39,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 11694 treesize of output 4050 [2021-11-22 14:40:39,632 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:40:39,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2042 treesize of output 1932 [2021-11-22 14:40:40,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-22 14:40:40,785 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:40:40,786 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 19 treesize of output 23 [2021-11-22 14:40:40,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 8 treesize of output 4 [2021-11-22 14:40:41,040 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:40:41,078 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:40:41,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 106 [2021-11-22 14:40:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:40:42,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037722138] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:40:42,666 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:40:42,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 76 [2021-11-22 14:40:42,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656847749] [2021-11-22 14:40:42,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:40:42,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2021-11-22 14:40:42,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:40:42,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-11-22 14:40:42,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5546, Unknown=20, NotChecked=0, Total=5852 [2021-11-22 14:40:42,669 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 77 states, 76 states have (on average 2.4210526315789473) internal successors, (184), 77 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:40:45,591 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse1) 4)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~s~0#1.offset_25| Int) (v_DerPreprocessor_15 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_49| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_40| Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_49|) (<= 0 (select (select (let ((.cse6 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse2 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (store .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_49|))))) (store .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse6 v_DerPreprocessor_15)))) (.cse3 (select (store (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse6 v_DerPreprocessor_14) |v_ULTIMATE.start_main_~s~0#1.offset_25|))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_40|) v_DerPreprocessor_13)))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_25|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |v_ULTIMATE.start_main_~s~0#1.offset_25|) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_49| |v_ULTIMATE.start_main_~s~0#1.offset_25|) (< |v_ULTIMATE.start_main_~s~0#1.offset_25| 0))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) 4)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2021-11-22 14:40:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:40:50,679 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2021-11-22 14:40:50,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-22 14:40:50,679 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 2.4210526315789473) internal successors, (184), 77 states have internal predecessors, (184), 0 states have call successors, (0), 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-11-22 14:40:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:40:50,680 INFO L225 Difference]: With dead ends: 93 [2021-11-22 14:40:50,680 INFO L226 Difference]: Without dead ends: 93 [2021-11-22 14:40:50,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 69 SyntacticMatches, 14 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2413 ImplicationChecksByTransitivity, 65.8s TimeCoverageRelationStatistics Valid=533, Invalid=9151, Unknown=22, NotChecked=194, Total=9900 [2021-11-22 14:40:50,682 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 91 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 14:40:50,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 1187 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 686 Invalid, 0 Unknown, 401 Unchecked, 0.6s Time] [2021-11-22 14:40:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-22 14:40:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2021-11-22 14:40:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 1.1139240506329113) internal successors, (88), 85 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-11-22 14:40:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2021-11-22 14:40:50,686 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 63 [2021-11-22 14:40:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:40:50,686 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2021-11-22 14:40:50,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.4210526315789473) internal successors, (184), 77 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:40:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2021-11-22 14:40:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 14:40:50,687 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:40:50,688 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:40:50,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-11-22 14:40:50,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-11-22 14:40:50,894 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:40:50,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:40:50,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1707624273, now seen corresponding path program 1 times [2021-11-22 14:40:50,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:40:50,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84657513] [2021-11-22 14:40:50,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:40:50,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:40:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:40:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-22 14:40:51,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:40:51,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84657513] [2021-11-22 14:40:51,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84657513] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:40:51,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:40:51,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 14:40:51,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005743039] [2021-11-22 14:40:51,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:40:51,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 14:40:51,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:40:51,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 14:40:51,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:40:51,026 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:40:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:40:51,346 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2021-11-22 14:40:51,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 14:40:51,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-22 14:40:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:40:51,348 INFO L225 Difference]: With dead ends: 85 [2021-11-22 14:40:51,348 INFO L226 Difference]: Without dead ends: 85 [2021-11-22 14:40:51,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-22 14:40:51,349 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 289 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:40:51,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 55 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:40:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-22 14:40:51,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-11-22 14:40:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 84 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:40:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2021-11-22 14:40:51,363 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 64 [2021-11-22 14:40:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:40:51,363 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2021-11-22 14:40:51,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:40:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2021-11-22 14:40:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-22 14:40:51,364 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:40:51,365 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:40:51,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-22 14:40:51,365 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:40:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:40:51,366 INFO L85 PathProgramCache]: Analyzing trace with hash 350843222, now seen corresponding path program 1 times [2021-11-22 14:40:51,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:40:51,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651785910] [2021-11-22 14:40:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:40:51,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:40:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:40:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-22 14:40:52,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:40:52,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651785910] [2021-11-22 14:40:52,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651785910] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:40:52,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72536164] [2021-11-22 14:40:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:40:52,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:40:52,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:40:52,394 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:40:52,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-22 14:40:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:40:52,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-22 14:40:52,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:40:52,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 14:40:52,571 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 14:40:52,572 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-11-22 14:40:52,761 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 11 treesize of output 7 [2021-11-22 14:40:52,845 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-22 14:40:52,845 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 32 [2021-11-22 14:40:53,034 INFO L354 Elim1Store]: treesize reduction 60, result has 22.1 percent of original size [2021-11-22 14:40:53,034 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 44 treesize of output 37 [2021-11-22 14:40:53,167 INFO L354 Elim1Store]: treesize reduction 76, result has 18.3 percent of original size [2021-11-22 14:40:53,168 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 51 treesize of output 44 [2021-11-22 14:40:53,567 INFO L354 Elim1Store]: treesize reduction 150, result has 14.8 percent of original size [2021-11-22 14:40:53,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 50 [2021-11-22 14:40:54,034 INFO L354 Elim1Store]: treesize reduction 222, result has 13.6 percent of original size [2021-11-22 14:40:54,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 105 treesize of output 74 [2021-11-22 14:40:54,405 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 14:40:54,405 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 42 treesize of output 16 [2021-11-22 14:40:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-22 14:40:54,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:40:55,690 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_16 Int) (|ULTIMATE.start_dll_circular_update_at_~head#1.offset| Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_16)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-11-22 14:40:56,841 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_16 Int) (|ULTIMATE.start_dll_circular_update_at_~head#1.offset| Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) (+ 8 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_16)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-11-22 14:41:21,529 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_DerPreprocessor_16 Int)) (<= (+ (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44|) v_DerPreprocessor_16))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-11-22 14:41:39,547 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= (+ (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| 8) v_DerPreprocessor_17))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44|) v_DerPreprocessor_16)))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2021-11-22 14:41:41,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= (+ (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| 8) v_DerPreprocessor_17))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44|) v_DerPreprocessor_16)))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2021-11-22 14:41:43,582 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= (+ (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| 8) v_DerPreprocessor_17))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44|) v_DerPreprocessor_16)))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2021-11-22 14:41:45,603 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= (+ (select (select (let ((.cse2 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| 8) v_DerPreprocessor_17))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44|) v_DerPreprocessor_16)))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2021-11-22 14:41:47,627 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= (+ (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse2 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| 8) v_DerPreprocessor_17))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44|) v_DerPreprocessor_16))))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2021-11-22 14:41:49,669 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (or (<= (+ (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse2 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| 8) v_DerPreprocessor_17))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44|) v_DerPreprocessor_16))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2021-11-22 14:41:51,705 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= (+ (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse2 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_46| 8) v_DerPreprocessor_17))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44|) v_DerPreprocessor_16))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2021-11-22 14:41:51,796 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-11-22 14:41:51,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 13317 treesize of output 6873 [2021-11-22 14:41:51,847 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:41:51,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6873 treesize of output 6675 [2021-11-22 14:41:51,904 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-22 14:41:51,904 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-22 14:41:51,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2021-11-22 14:41:51,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903669126] [2021-11-22 14:41:51,905 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-22 14:41:51,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-22 14:41:51,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:41:51,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-22 14:41:51,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1744, Unknown=26, NotChecked=930, Total=2862 [2021-11-22 14:41:51,906 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:41:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:41:54,014 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2021-11-22 14:41:54,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-22 14:41:54,015 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 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 66 [2021-11-22 14:41:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:41:54,016 INFO L225 Difference]: With dead ends: 90 [2021-11-22 14:41:54,016 INFO L226 Difference]: Without dead ends: 90 [2021-11-22 14:41:54,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 60.1s TimeCoverageRelationStatistics Valid=419, Invalid=3501, Unknown=26, NotChecked=1310, Total=5256 [2021-11-22 14:41:54,017 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 383 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 14:41:54,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 378 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 14:41:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-11-22 14:41:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2021-11-22 14:41:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 80 states have (on average 1.0875) internal successors, (87), 85 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-11-22 14:41:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2021-11-22 14:41:54,020 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 66 [2021-11-22 14:41:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:41:54,021 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2021-11-22 14:41:54,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:41:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2021-11-22 14:41:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-22 14:41:54,022 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:41:54,022 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:41:54,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-22 14:41:54,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-22 14:41:54,223 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:41:54,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:41:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2052690548, now seen corresponding path program 1 times [2021-11-22 14:41:54,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:41:54,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094253555] [2021-11-22 14:41:54,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:41:54,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:41:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:41:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-22 14:41:54,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:41:54,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094253555] [2021-11-22 14:41:54,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094253555] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:41:54,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578056662] [2021-11-22 14:41:54,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:41:54,892 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:41:54,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:41:54,893 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:41:54,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-22 14:41:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:41:55,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-22 14:41:55,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:41:55,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 14:41:55,080 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 14:41:55,080 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-11-22 14:41:55,194 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 11 treesize of output 7 [2021-11-22 14:41:55,282 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-22 14:41:55,282 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 37 treesize of output 27 [2021-11-22 14:41:55,433 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-22 14:41:55,434 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 28 treesize of output 30 [2021-11-22 14:41:55,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:41:55,502 INFO L354 Elim1Store]: treesize reduction 49, result has 15.5 percent of original size [2021-11-22 14:41:55,502 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 2 case distinctions, treesize of input 39 treesize of output 36 [2021-11-22 14:41:55,828 INFO L354 Elim1Store]: treesize reduction 120, result has 16.7 percent of original size [2021-11-22 14:41:55,829 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 6 case distinctions, treesize of input 55 treesize of output 40 [2021-11-22 14:41:56,121 INFO L354 Elim1Store]: treesize reduction 122, result has 19.7 percent of original size [2021-11-22 14:41:56,122 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 6 case distinctions, treesize of input 64 treesize of output 58 [2021-11-22 14:41:56,373 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:41:56,373 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 3 case distinctions, treesize of input 27 treesize of output 27 [2021-11-22 14:41:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-22 14:41:56,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:41:58,142 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_18 Int) (|ULTIMATE.start_dll_circular_update_at_~head#1.offset| Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) is different from false [2021-11-22 14:42:21,917 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18))) |c_ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) is different from false [2021-11-22 14:42:58,365 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18)))) |c_ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) is different from false [2021-11-22 14:43:00,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (not (= (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18)))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) is different from false [2021-11-22 14:43:02,487 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (not (= (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18)))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) is different from false [2021-11-22 14:43:04,561 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (let ((.cse2 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18)))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) is different from false [2021-11-22 14:43:06,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse2 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18))))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) is different from false [2021-11-22 14:43:08,791 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse2 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) is different from false [2021-11-22 14:43:10,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse2 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) is different from false [2021-11-22 14:43:11,172 INFO L354 Elim1Store]: treesize reduction 156, result has 31.0 percent of original size [2021-11-22 14:43:11,173 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 4 case distinctions, treesize of input 99772 treesize of output 38337 [2021-11-22 14:43:12,063 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:43:12,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35937 treesize of output 34097 [2021-11-22 14:43:14,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-22 14:43:15,255 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 14:43:15,256 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 15 treesize of output 9 [2021-11-22 14:43:15,287 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-11-22 14:43:15,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:43:15,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:43:15,394 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:43:15,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 168 [2021-11-22 14:43:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 9 not checked. [2021-11-22 14:43:17,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578056662] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:43:17,318 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:43:17,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 25] total 62 [2021-11-22 14:43:17,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690882367] [2021-11-22 14:43:17,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:43:17,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-11-22 14:43:17,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:43:17,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-11-22 14:43:17,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2568, Unknown=39, NotChecked=990, Total=3782 [2021-11-22 14:43:17,321 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 62 states, 62 states have (on average 2.564516129032258) internal successors, (159), 62 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:43:23,427 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_node_create_#res#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse2 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1)) is different from false [2021-11-22 14:43:25,433 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse2 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-11-22 14:43:27,440 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse2 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-11-22 14:43:29,445 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_54| Int)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_54| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse2 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18))))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2021-11-22 14:43:31,451 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (forall ((v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (let ((.cse2 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18)))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_54| Int)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_54| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2021-11-22 14:43:33,455 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) .cse1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_54| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_54| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (not (= (select (select (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18)))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)))))) is different from false [2021-11-22 14:43:35,460 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse3 (select .cse4 0))) (and (forall ((v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (not (= (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18)))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse3)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_54| Int)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_54| 4)))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= .cse3 (select .cse4 4))))) is different from false [2021-11-22 14:43:37,465 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 0))) (and (= .cse0 (select .cse1 4)) (forall ((v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_19 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_19))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48|) v_DerPreprocessor_18)))) |c_ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_54| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 0)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_54| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-11-22 14:43:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:43:40,691 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2021-11-22 14:43:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-22 14:43:40,691 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.564516129032258) internal successors, (159), 62 states have internal predecessors, (159), 0 states have call successors, (0), 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 67 [2021-11-22 14:43:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:43:40,692 INFO L225 Difference]: With dead ends: 84 [2021-11-22 14:43:40,692 INFO L226 Difference]: Without dead ends: 84 [2021-11-22 14:43:40,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 17 IntricatePredicates, 2 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 97.8s TimeCoverageRelationStatistics Valid=367, Invalid=4208, Unknown=49, NotChecked=2516, Total=7140 [2021-11-22 14:43:40,694 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 167 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 702 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 14:43:40,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 778 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 764 Invalid, 0 Unknown, 702 Unchecked, 0.6s Time] [2021-11-22 14:43:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-22 14:43:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-11-22 14:43:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 77 states have (on average 1.077922077922078) internal successors, (83), 82 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:43:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2021-11-22 14:43:40,699 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 67 [2021-11-22 14:43:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:43:40,700 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2021-11-22 14:43:40,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.564516129032258) internal successors, (159), 62 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:43:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2021-11-22 14:43:40,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 14:43:40,701 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:43:40,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:43:40,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-22 14:43:40,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:43:40,918 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 36 more)] === [2021-11-22 14:43:40,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:43:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1979767621, now seen corresponding path program 1 times [2021-11-22 14:43:40,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:43:40,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429258766] [2021-11-22 14:43:40,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:43:40,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:43:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:43:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-22 14:43:42,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:43:42,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429258766] [2021-11-22 14:43:42,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429258766] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:43:42,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983068148] [2021-11-22 14:43:42,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:43:42,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:43:42,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:43:42,510 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:43:42,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b388123-1b58-43e2-9813-ca8e884c1f2c/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-22 14:43:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:43:42,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 97 conjunts are in the unsatisfiable core [2021-11-22 14:43:42,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:43:42,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 14:43:42,738 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 14:43:42,738 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-11-22 14:43:42,975 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 11 treesize of output 7 [2021-11-22 14:43:42,983 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 11 treesize of output 7 [2021-11-22 14:43:43,091 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-22 14:43:43,091 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 65 treesize of output 47 [2021-11-22 14:43:43,104 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-11-22 14:43:43,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 52 [2021-11-22 14:43:43,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:43:43,315 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-22 14:43:43,315 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 2 case distinctions, treesize of input 71 treesize of output 64 [2021-11-22 14:43:43,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:43:43,331 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-22 14:43:43,332 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 2 case distinctions, treesize of input 55 treesize of output 57 [2021-11-22 14:43:43,470 INFO L354 Elim1Store]: treesize reduction 158, result has 16.8 percent of original size [2021-11-22 14:43:43,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 102 [2021-11-22 14:43:43,509 INFO L354 Elim1Store]: treesize reduction 156, result has 17.9 percent of original size [2021-11-22 14:43:43,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 111 [2021-11-22 14:43:44,076 INFO L354 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2021-11-22 14:43:44,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 133 treesize of output 99 [2021-11-22 14:43:44,143 INFO L354 Elim1Store]: treesize reduction 248, result has 14.8 percent of original size [2021-11-22 14:43:44,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 107 [2021-11-22 14:43:44,787 INFO L354 Elim1Store]: treesize reduction 204, result has 13.2 percent of original size [2021-11-22 14:43:44,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 161 treesize of output 121 [2021-11-22 14:43:44,841 INFO L354 Elim1Store]: treesize reduction 244, result has 13.8 percent of original size [2021-11-22 14:43:44,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 97 [2021-11-22 14:43:46,081 INFO L354 Elim1Store]: treesize reduction 96, result has 15.0 percent of original size [2021-11-22 14:43:46,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 76 [2021-11-22 14:43:46,131 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-22 14:43:46,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 52 [2021-11-22 14:43:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-22 14:43:46,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:43:50,074 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (and (forall ((v_DerPreprocessor_20 Int) (v_DerPreprocessor_21 Int)) (= (select (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_DerPreprocessor_21)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_DerPreprocessor_20)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (forall ((v_DerPreprocessor_20 Int)) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_20)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))) (< |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0))) is different from false [2021-11-22 14:43:52,285 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0) (and (forall ((v_DerPreprocessor_20 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8) v_DerPreprocessor_20)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_DerPreprocessor_20 Int) (v_DerPreprocessor_21 Int)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) .cse1 v_DerPreprocessor_21)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) .cse1 v_DerPreprocessor_20)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))))) is different from false [2021-11-22 14:43:54,475 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (and (forall ((v_DerPreprocessor_20 Int)) (= (select (let ((.cse0 (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8) v_DerPreprocessor_20))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_DerPreprocessor_20 Int) (v_DerPreprocessor_21 Int)) (= (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (select (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 v_DerPreprocessor_21)) (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 v_DerPreprocessor_20)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0))) is different from false [2021-11-22 14:43:56,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (and (forall ((v_DerPreprocessor_20 Int)) (= (select (let ((.cse0 (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8) v_DerPreprocessor_20))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_DerPreprocessor_20 Int) (v_DerPreprocessor_21 Int)) (= (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (select (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 v_DerPreprocessor_21)) (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 v_DerPreprocessor_20)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0))) is different from false [2021-11-22 14:43:59,255 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_23 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (and (forall ((v_DerPreprocessor_22 Int) (v_DerPreprocessor_20 Int)) (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_22)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8) v_DerPreprocessor_20)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_DerPreprocessor_22 Int) (v_prenex_14 Int) (v_DerPreprocessor_21 Int)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse6 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse6 v_DerPreprocessor_22)))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse6 v_DerPreprocessor_23)))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_DerPreprocessor_21))) (select (select (store .cse7 .cse4 (store (select .cse7 .cse4) .cse5 v_prenex_14)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_23)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (< |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0))) is different from false [2021-11-22 14:44:01,997 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_23 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_DerPreprocessor_22 Int) (v_prenex_14 Int) (v_DerPreprocessor_21 Int)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8))) (let ((.cse5 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_DerPreprocessor_22))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (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|) .cse3 v_DerPreprocessor_23)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_21))) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse5))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_prenex_14))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|))) (forall ((v_DerPreprocessor_22 Int) (v_DerPreprocessor_20 Int)) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse6 (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8) v_DerPreprocessor_22))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse9)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~s~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8) v_DerPreprocessor_20)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8) v_DerPreprocessor_23) |c_ULTIMATE.start_main_~s~0#1.offset|)) (< |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0))) is different from false [2021-11-22 14:44:04,741 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_23 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (and (forall ((v_DerPreprocessor_22 Int) (v_prenex_14 Int) (v_DerPreprocessor_21 Int)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| (select (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8))) (let ((.cse5 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse3 v_DerPreprocessor_22))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse3 v_DerPreprocessor_23)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_21))) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse5))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_prenex_14))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|))) (forall ((v_DerPreprocessor_22 Int) (v_DerPreprocessor_20 Int)) (= (select (let ((.cse6 (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8) v_DerPreprocessor_22))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse9)) (.cse8 (select .cse9 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8) v_DerPreprocessor_20)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8) v_DerPreprocessor_23) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0))) is different from false [2021-11-22 14:44:07,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_23 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8) v_DerPreprocessor_23) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (< |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_DerPreprocessor_22 Int) (v_DerPreprocessor_20 Int)) (= (select (let ((.cse0 (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8) v_DerPreprocessor_22))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8) v_DerPreprocessor_20)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_DerPreprocessor_22 Int) (v_prenex_14 Int) (v_DerPreprocessor_21 Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (let ((.cse7 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8))) (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7 v_DerPreprocessor_22))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse6 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7 v_DerPreprocessor_23)))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_DerPreprocessor_21))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse9))) (store .cse8 .cse5 (store (select .cse8 .cse5) .cse6 v_prenex_14))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))))) is different from false [2021-11-22 14:44:09,806 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_23 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8) v_DerPreprocessor_23) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_DerPreprocessor_22 Int) (v_DerPreprocessor_20 Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (let ((.cse0 (let ((.cse3 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8) v_DerPreprocessor_22))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8) v_DerPreprocessor_20)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|))) (forall ((v_DerPreprocessor_22 Int) (v_prenex_14 Int) (v_DerPreprocessor_21 Int)) (= (select (let ((.cse7 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (.cse8 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8))) (let ((.cse10 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse8 v_DerPreprocessor_22))) (let ((.cse5 (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse6 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) .cse8 v_DerPreprocessor_23)))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_DerPreprocessor_21))) (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse10))) (store .cse9 .cse5 (store (select .cse9 .cse5) .cse6 v_prenex_14))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2021-11-22 14:44:30,804 INFO L354 Elim1Store]: treesize reduction 4036, result has 31.0 percent of original size [2021-11-22 14:44:30,809 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 4 case distinctions, treesize of input 242138525 treesize of output 240354422