./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 19:12:14,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 19:12:14,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 19:12:14,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 19:12:14,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 19:12:14,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 19:12:14,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 19:12:14,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 19:12:14,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 19:12:14,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 19:12:14,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 19:12:14,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 19:12:14,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 19:12:14,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 19:12:14,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 19:12:14,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 19:12:14,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 19:12:14,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 19:12:14,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 19:12:14,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 19:12:14,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 19:12:14,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 19:12:14,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 19:12:14,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 19:12:14,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 19:12:14,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 19:12:14,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 19:12:14,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 19:12:14,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 19:12:14,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 19:12:14,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 19:12:14,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 19:12:14,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 19:12:14,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 19:12:14,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 19:12:14,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 19:12:14,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 19:12:14,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 19:12:14,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 19:12:14,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 19:12:14,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 19:12:14,445 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-06 19:12:14,461 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 19:12:14,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 19:12:14,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 19:12:14,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 19:12:14,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 19:12:14,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 19:12:14,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 19:12:14,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 19:12:14,463 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 19:12:14,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 19:12:14,463 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 19:12:14,463 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 19:12:14,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 19:12:14,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 19:12:14,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 19:12:14,464 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 19:12:14,464 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 19:12:14,464 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 19:12:14,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 19:12:14,464 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 19:12:14,464 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 19:12:14,464 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 19:12:14,464 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 19:12:14,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 19:12:14,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 19:12:14,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:12:14,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 19:12:14,465 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 19:12:14,465 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 19:12:14,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 19:12:14,465 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 19:12:14,465 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_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2021-12-06 19:12:14,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 19:12:14,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 19:12:14,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 19:12:14,673 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 19:12:14,673 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 19:12:14,674 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-12-06 19:12:14,716 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/data/891491461/6733272e124d45a08ab262e9f510d41f/FLAG6df9e7ff5 [2021-12-06 19:12:15,169 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 19:12:15,170 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-12-06 19:12:15,181 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/data/891491461/6733272e124d45a08ab262e9f510d41f/FLAG6df9e7ff5 [2021-12-06 19:12:15,192 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/data/891491461/6733272e124d45a08ab262e9f510d41f [2021-12-06 19:12:15,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 19:12:15,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 19:12:15,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 19:12:15,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 19:12:15,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 19:12:15,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:12:15" (1/1) ... [2021-12-06 19:12:15,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31751c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:15, skipping insertion in model container [2021-12-06 19:12:15,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:12:15" (1/1) ... [2021-12-06 19:12:15,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 19:12:15,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 19:12:15,432 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_525169f3-232a-4acc-b4d4-089e9abd5557/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2021-12-06 19:12:15,434 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:12:15,440 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 19:12:15,470 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_525169f3-232a-4acc-b4d4-089e9abd5557/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2021-12-06 19:12:15,470 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:12:15,491 INFO L208 MainTranslator]: Completed translation [2021-12-06 19:12:15,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:15 WrapperNode [2021-12-06 19:12:15,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 19:12:15,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 19:12:15,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 19:12:15,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 19:12:15,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:15" (1/1) ... [2021-12-06 19:12:15,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:15" (1/1) ... [2021-12-06 19:12:15,527 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2021-12-06 19:12:15,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 19:12:15,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 19:12:15,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 19:12:15,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 19:12:15,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:15" (1/1) ... [2021-12-06 19:12:15,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:15" (1/1) ... [2021-12-06 19:12:15,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:15" (1/1) ... [2021-12-06 19:12:15,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:15" (1/1) ... [2021-12-06 19:12:15,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:15" (1/1) ... [2021-12-06 19:12:15,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:15" (1/1) ... [2021-12-06 19:12:15,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:15" (1/1) ... [2021-12-06 19:12:15,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 19:12:15,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 19:12:15,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 19:12:15,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 19:12:15,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:15" (1/1) ... [2021-12-06 19:12:15,558 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:12:15,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:15,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 19:12:15,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 19:12:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 19:12:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 19:12:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-06 19:12:15,608 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-06 19:12:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 19:12:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 19:12:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 19:12:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 19:12:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 19:12:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 19:12:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 19:12:15,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 19:12:15,695 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 19:12:15,697 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 19:12:15,908 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 19:12:15,914 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 19:12:15,914 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-06 19:12:15,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:12:15 BoogieIcfgContainer [2021-12-06 19:12:15,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 19:12:15,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 19:12:15,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 19:12:15,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 19:12:15,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:12:15" (1/3) ... [2021-12-06 19:12:15,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b0a203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:12:15, skipping insertion in model container [2021-12-06 19:12:15,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:15" (2/3) ... [2021-12-06 19:12:15,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b0a203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:12:15, skipping insertion in model container [2021-12-06 19:12:15,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:12:15" (3/3) ... [2021-12-06 19:12:15,922 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2021-12-06 19:12:15,926 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 19:12:15,926 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2021-12-06 19:12:15,957 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 19:12:15,962 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 19:12:15,963 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-12-06 19:12:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-06 19:12:15,979 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:15,979 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-06 19:12:15,980 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash 894964530, now seen corresponding path program 1 times [2021-12-06 19:12:15,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:15,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930534852] [2021-12-06 19:12:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:15,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:12:16,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:16,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930534852] [2021-12-06 19:12:16,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930534852] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:16,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:12:16,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 19:12:16,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117819376] [2021-12-06 19:12:16,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:16,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:12:16,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:16,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:12:16,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 19:12:16,170 INFO L87 Difference]: Start difference. First operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:12:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:16,253 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2021-12-06 19:12:16,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:12:16,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-06 19:12:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:16,261 INFO L225 Difference]: With dead ends: 90 [2021-12-06 19:12:16,261 INFO L226 Difference]: Without dead ends: 87 [2021-12-06 19:12:16,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 19:12:16,265 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:16,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 147 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:12:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-06 19:12:16,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-06 19:12:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-06 19:12:16,303 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 6 [2021-12-06 19:12:16,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:16,303 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-06 19:12:16,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:12:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-06 19:12:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-06 19:12:16,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:16,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-06 19:12:16,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 19:12:16,305 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:16,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:16,306 INFO L85 PathProgramCache]: Analyzing trace with hash 894964531, now seen corresponding path program 1 times [2021-12-06 19:12:16,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:16,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144659182] [2021-12-06 19:12:16,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:16,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:12:16,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:16,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144659182] [2021-12-06 19:12:16,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144659182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:16,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:12:16,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 19:12:16,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374612689] [2021-12-06 19:12:16,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:16,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:12:16,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:16,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:12:16,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 19:12:16,360 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:12:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:16,406 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2021-12-06 19:12:16,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:12:16,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-06 19:12:16,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:16,408 INFO L225 Difference]: With dead ends: 84 [2021-12-06 19:12:16,408 INFO L226 Difference]: Without dead ends: 84 [2021-12-06 19:12:16,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 19:12:16,410 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:16,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:12:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-06 19:12:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-06 19:12:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-06 19:12:16,420 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2021-12-06 19:12:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:16,421 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-06 19:12:16,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:12:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-06 19:12:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-06 19:12:16,422 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:16,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:12:16,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 19:12:16,422 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:16,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:16,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1046244471, now seen corresponding path program 1 times [2021-12-06 19:12:16,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:16,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71122596] [2021-12-06 19:12:16,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:16,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:16,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:12:16,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:16,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71122596] [2021-12-06 19:12:16,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71122596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:16,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:12:16,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 19:12:16,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975561881] [2021-12-06 19:12:16,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:16,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:12:16,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:16,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:12:16,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 19:12:16,514 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 19:12:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:16,574 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2021-12-06 19:12:16,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 19:12:16,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-12-06 19:12:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:16,576 INFO L225 Difference]: With dead ends: 95 [2021-12-06 19:12:16,576 INFO L226 Difference]: Without dead ends: 95 [2021-12-06 19:12:16,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 19:12:16,577 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:16,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 223 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:12:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-06 19:12:16,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2021-12-06 19:12:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2021-12-06 19:12:16,585 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2021-12-06 19:12:16,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:16,585 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2021-12-06 19:12:16,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 19:12:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2021-12-06 19:12:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-06 19:12:16,586 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:16,586 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:12:16,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 19:12:16,586 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:16,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:16,587 INFO L85 PathProgramCache]: Analyzing trace with hash 543084160, now seen corresponding path program 1 times [2021-12-06 19:12:16,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:16,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787697588] [2021-12-06 19:12:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:16,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:16,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:16,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:12:16,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:16,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787697588] [2021-12-06 19:12:16,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787697588] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:16,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:12:16,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:12:16,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056138429] [2021-12-06 19:12:16,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:16,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:12:16,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:16,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:12:16,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:12:16,685 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:16,804 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-12-06 19:12:16,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:12:16,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-12-06 19:12:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:16,807 INFO L225 Difference]: With dead ends: 105 [2021-12-06 19:12:16,808 INFO L226 Difference]: Without dead ends: 105 [2021-12-06 19:12:16,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:12:16,809 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 77 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:16,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 286 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:12:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-06 19:12:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2021-12-06 19:12:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-06 19:12:16,815 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 24 [2021-12-06 19:12:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:16,816 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-06 19:12:16,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:16,816 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-06 19:12:16,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-06 19:12:16,817 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:16,817 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:12:16,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 19:12:16,817 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:16,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:16,818 INFO L85 PathProgramCache]: Analyzing trace with hash 543084161, now seen corresponding path program 1 times [2021-12-06 19:12:16,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:16,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651269989] [2021-12-06 19:12:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:16,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:16,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:16,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:16,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:16,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651269989] [2021-12-06 19:12:16,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651269989] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:16,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:12:16,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:12:16,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723451522] [2021-12-06 19:12:16,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:16,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:12:16,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:16,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:12:16,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:12:16,955 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:17,057 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2021-12-06 19:12:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:12:17,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-12-06 19:12:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:17,058 INFO L225 Difference]: With dead ends: 84 [2021-12-06 19:12:17,058 INFO L226 Difference]: Without dead ends: 84 [2021-12-06 19:12:17,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:12:17,059 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 77 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:17,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 295 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:12:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-06 19:12:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-12-06 19:12:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 79 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2021-12-06 19:12:17,065 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 24 [2021-12-06 19:12:17,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:17,065 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2021-12-06 19:12:17,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2021-12-06 19:12:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 19:12:17,066 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:17,066 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:12:17,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 19:12:17,066 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132639, now seen corresponding path program 1 times [2021-12-06 19:12:17,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:17,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010703393] [2021-12-06 19:12:17,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:17,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:17,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:17,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:17,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:17,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010703393] [2021-12-06 19:12:17,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010703393] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:17,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123045633] [2021-12-06 19:12:17,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:17,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:17,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:17,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:17,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 19:12:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:17,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-06 19:12:17,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:17,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:12:17,506 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 19:12:17,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-06 19:12:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:12:17,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:17,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123045633] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:17,573 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:12:17,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-12-06 19:12:17,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261218219] [2021-12-06 19:12:17,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:17,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:12:17,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:17,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:12:17,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-06 19:12:17,575 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 19:12:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:17,719 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2021-12-06 19:12:17,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:12:17,720 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2021-12-06 19:12:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:17,720 INFO L225 Difference]: With dead ends: 110 [2021-12-06 19:12:17,721 INFO L226 Difference]: Without dead ends: 110 [2021-12-06 19:12:17,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-06 19:12:17,722 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 69 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:17,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 420 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 284 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2021-12-06 19:12:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-06 19:12:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2021-12-06 19:12:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.603448275862069) internal successors, (93), 83 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:12:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2021-12-06 19:12:17,727 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 26 [2021-12-06 19:12:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:17,727 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2021-12-06 19:12:17,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 19:12:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2021-12-06 19:12:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 19:12:17,728 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:17,728 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:12:17,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 19:12:17,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-06 19:12:17,929 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:17,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132638, now seen corresponding path program 1 times [2021-12-06 19:12:17,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:17,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419111350] [2021-12-06 19:12:17,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:17,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:17,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:18,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:18,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:18,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419111350] [2021-12-06 19:12:18,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419111350] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:18,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502280137] [2021-12-06 19:12:18,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:18,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:18,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:18,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:18,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 19:12:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:18,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-06 19:12:18,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:18,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:12:18,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:12:18,404 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 14 treesize of output 16 [2021-12-06 19:12:18,410 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:12:18,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:12:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:12:18,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:18,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502280137] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:18,518 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:12:18,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2021-12-06 19:12:18,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754592964] [2021-12-06 19:12:18,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:18,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-06 19:12:18,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:18,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-06 19:12:18,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-12-06 19:12:18,520 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 19:12:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:18,754 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2021-12-06 19:12:18,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 19:12:18,755 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2021-12-06 19:12:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:18,756 INFO L225 Difference]: With dead ends: 90 [2021-12-06 19:12:18,756 INFO L226 Difference]: Without dead ends: 90 [2021-12-06 19:12:18,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-12-06 19:12:18,757 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 25 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:18,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 690 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 465 Invalid, 0 Unknown, 2 Unchecked, 0.2s Time] [2021-12-06 19:12:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-06 19:12:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2021-12-06 19:12:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:12:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2021-12-06 19:12:18,764 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 26 [2021-12-06 19:12:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:18,765 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2021-12-06 19:12:18,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 19:12:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2021-12-06 19:12:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-06 19:12:18,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:18,766 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] [2021-12-06 19:12:18,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 19:12:18,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:18,968 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:18,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:18,969 INFO L85 PathProgramCache]: Analyzing trace with hash 525447991, now seen corresponding path program 1 times [2021-12-06 19:12:18,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:18,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128168965] [2021-12-06 19:12:18,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:18,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:19,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:19,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:19,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:19,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128168965] [2021-12-06 19:12:19,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128168965] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:19,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636232443] [2021-12-06 19:12:19,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:19,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:19,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:19,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:19,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 19:12:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:19,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 19:12:19,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:19,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:19,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:19,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636232443] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:12:19,367 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:12:19,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2021-12-06 19:12:19,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120879330] [2021-12-06 19:12:19,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:19,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:12:19,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:19,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:12:19,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:12:19,368 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:19,439 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2021-12-06 19:12:19,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:12:19,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2021-12-06 19:12:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:19,440 INFO L225 Difference]: With dead ends: 89 [2021-12-06 19:12:19,440 INFO L226 Difference]: Without dead ends: 89 [2021-12-06 19:12:19,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:12:19,441 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:19,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 436 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:12:19,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-06 19:12:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-12-06 19:12:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 83 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:12:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2021-12-06 19:12:19,448 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 28 [2021-12-06 19:12:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:19,448 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2021-12-06 19:12:19,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2021-12-06 19:12:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-06 19:12:19,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:19,450 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] [2021-12-06 19:12:19,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 19:12:19,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:19,650 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash -895762126, now seen corresponding path program 1 times [2021-12-06 19:12:19,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:19,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008229786] [2021-12-06 19:12:19,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:19,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:19,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:19,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 19:12:19,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:19,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008229786] [2021-12-06 19:12:19,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008229786] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:19,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950306860] [2021-12-06 19:12:19,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:19,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:19,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:19,717 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:19,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 19:12:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:19,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 19:12:19,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 19:12:19,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:19,834 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 19:12:19,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2021-12-06 19:12:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 19:12:19,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950306860] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:12:19,862 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:12:19,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2021-12-06 19:12:19,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259808730] [2021-12-06 19:12:19,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:19,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:12:19,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:19,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:12:19,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:12:19,863 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 19:12:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:19,940 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2021-12-06 19:12:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:12:19,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2021-12-06 19:12:19,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:19,941 INFO L225 Difference]: With dead ends: 113 [2021-12-06 19:12:19,941 INFO L226 Difference]: Without dead ends: 113 [2021-12-06 19:12:19,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:12:19,942 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 125 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:19,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 209 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:12:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-06 19:12:19,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2021-12-06 19:12:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 86 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:12:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2021-12-06 19:12:19,948 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 29 [2021-12-06 19:12:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:19,948 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2021-12-06 19:12:19,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 19:12:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2021-12-06 19:12:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-06 19:12:19,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:19,949 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] [2021-12-06 19:12:19,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 19:12:20,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-12-06 19:12:20,150 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:20,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:20,150 INFO L85 PathProgramCache]: Analyzing trace with hash -895762125, now seen corresponding path program 1 times [2021-12-06 19:12:20,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:20,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007830268] [2021-12-06 19:12:20,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:20,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:20,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:20,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:20,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007830268] [2021-12-06 19:12:20,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007830268] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:20,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916114358] [2021-12-06 19:12:20,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:20,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:20,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:20,248 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:20,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 19:12:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:20,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-06 19:12:20,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:20,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:20,447 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:12:20,447 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-12-06 19:12:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:20,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916114358] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:12:20,555 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:12:20,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2021-12-06 19:12:20,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683514786] [2021-12-06 19:12:20,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:20,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-06 19:12:20,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:20,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-06 19:12:20,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:12:20,557 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-06 19:12:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:20,750 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2021-12-06 19:12:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:12:20,751 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2021-12-06 19:12:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:20,752 INFO L225 Difference]: With dead ends: 150 [2021-12-06 19:12:20,752 INFO L226 Difference]: Without dead ends: 150 [2021-12-06 19:12:20,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-12-06 19:12:20,753 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 200 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:20,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 752 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:12:20,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-06 19:12:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2021-12-06 19:12:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:12:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2021-12-06 19:12:20,757 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 29 [2021-12-06 19:12:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:20,757 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2021-12-06 19:12:20,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-06 19:12:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2021-12-06 19:12:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 19:12:20,758 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:20,758 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] [2021-12-06 19:12:20,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-06 19:12:20,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-06 19:12:20,958 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:20,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:20,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822125, now seen corresponding path program 1 times [2021-12-06 19:12:20,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:20,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358763130] [2021-12-06 19:12:20,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:20,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:12:21,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:21,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358763130] [2021-12-06 19:12:21,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358763130] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:21,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:12:21,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:12:21,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207289532] [2021-12-06 19:12:21,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:21,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:12:21,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:21,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:12:21,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:12:21,032 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:21,128 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2021-12-06 19:12:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 19:12:21,128 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-06 19:12:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:21,129 INFO L225 Difference]: With dead ends: 111 [2021-12-06 19:12:21,129 INFO L226 Difference]: Without dead ends: 111 [2021-12-06 19:12:21,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:12:21,130 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 135 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:21,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 294 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:12:21,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-06 19:12:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2021-12-06 19:12:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.540983606557377) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:12:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2021-12-06 19:12:21,134 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 30 [2021-12-06 19:12:21,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:21,134 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2021-12-06 19:12:21,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2021-12-06 19:12:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 19:12:21,136 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:21,136 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] [2021-12-06 19:12:21,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 19:12:21,136 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:21,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:21,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822124, now seen corresponding path program 1 times [2021-12-06 19:12:21,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:21,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145147821] [2021-12-06 19:12:21,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:21,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:21,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:21,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145147821] [2021-12-06 19:12:21,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145147821] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:21,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:12:21,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 19:12:21,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302398651] [2021-12-06 19:12:21,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:21,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 19:12:21,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:21,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 19:12:21,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:12:21,244 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:21,342 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2021-12-06 19:12:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 19:12:21,343 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-06 19:12:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:21,343 INFO L225 Difference]: With dead ends: 89 [2021-12-06 19:12:21,344 INFO L226 Difference]: Without dead ends: 89 [2021-12-06 19:12:21,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:12:21,344 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 142 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:21,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 295 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:12:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-06 19:12:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-06 19:12:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:12:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2021-12-06 19:12:21,347 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 30 [2021-12-06 19:12:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:21,347 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2021-12-06 19:12:21,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:21,348 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2021-12-06 19:12:21,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 19:12:21,348 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:21,348 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] [2021-12-06 19:12:21,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 19:12:21,349 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:21,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:21,349 INFO L85 PathProgramCache]: Analyzing trace with hash 452746567, now seen corresponding path program 1 times [2021-12-06 19:12:21,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:21,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874237989] [2021-12-06 19:12:21,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:21,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:12:21,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:21,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874237989] [2021-12-06 19:12:21,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874237989] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:21,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:12:21,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 19:12:21,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390693483] [2021-12-06 19:12:21,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:21,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:12:21,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:21,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:12:21,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:12:21,424 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:21,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:21,612 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2021-12-06 19:12:21,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 19:12:21,613 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2021-12-06 19:12:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:21,614 INFO L225 Difference]: With dead ends: 158 [2021-12-06 19:12:21,614 INFO L226 Difference]: Without dead ends: 158 [2021-12-06 19:12:21,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:12:21,615 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 320 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:21,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 509 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:12:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-06 19:12:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 92. [2021-12-06 19:12:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:12:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2021-12-06 19:12:21,619 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 35 [2021-12-06 19:12:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:21,620 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2021-12-06 19:12:21,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2021-12-06 19:12:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 19:12:21,621 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:21,621 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] [2021-12-06 19:12:21,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 19:12:21,621 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:21,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash 452746568, now seen corresponding path program 1 times [2021-12-06 19:12:21,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:21,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758400067] [2021-12-06 19:12:21,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:21,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:21,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:21,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758400067] [2021-12-06 19:12:21,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758400067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:21,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:12:21,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 19:12:21,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836433406] [2021-12-06 19:12:21,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:21,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:12:21,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:21,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:12:21,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:12:21,757 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:21,943 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2021-12-06 19:12:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 19:12:21,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2021-12-06 19:12:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:21,944 INFO L225 Difference]: With dead ends: 138 [2021-12-06 19:12:21,944 INFO L226 Difference]: Without dead ends: 138 [2021-12-06 19:12:21,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:12:21,945 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 331 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:21,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 515 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:12:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-06 19:12:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2021-12-06 19:12:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.515625) internal successors, (97), 87 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:12:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2021-12-06 19:12:21,948 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 35 [2021-12-06 19:12:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:21,948 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2021-12-06 19:12:21,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2021-12-06 19:12:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-06 19:12:21,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:21,949 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] [2021-12-06 19:12:21,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 19:12:21,949 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:21,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1296521997, now seen corresponding path program 1 times [2021-12-06 19:12:21,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:21,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047994553] [2021-12-06 19:12:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:21,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 19:12:21,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:21,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047994553] [2021-12-06 19:12:21,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047994553] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:21,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:12:21,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:12:21,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714061447] [2021-12-06 19:12:21,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:21,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:12:21,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:21,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:12:21,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:12:21,998 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:22,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:22,049 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2021-12-06 19:12:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:12:22,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2021-12-06 19:12:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:22,050 INFO L225 Difference]: With dead ends: 121 [2021-12-06 19:12:22,050 INFO L226 Difference]: Without dead ends: 121 [2021-12-06 19:12:22,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:12:22,050 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 89 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:22,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 209 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:12:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-06 19:12:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 94. [2021-12-06 19:12:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.5) internal successors, (99), 89 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:12:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2021-12-06 19:12:22,053 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 37 [2021-12-06 19:12:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:22,054 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2021-12-06 19:12:22,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2021-12-06 19:12:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-06 19:12:22,054 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:22,054 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] [2021-12-06 19:12:22,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 19:12:22,054 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:22,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:22,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337163, now seen corresponding path program 1 times [2021-12-06 19:12:22,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:22,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941328156] [2021-12-06 19:12:22,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:22,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 19:12:22,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:22,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941328156] [2021-12-06 19:12:22,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941328156] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:22,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:12:22,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:12:22,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830819258] [2021-12-06 19:12:22,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:22,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:12:22,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:22,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:12:22,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:12:22,104 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:22,153 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2021-12-06 19:12:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:12:22,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2021-12-06 19:12:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:22,154 INFO L225 Difference]: With dead ends: 170 [2021-12-06 19:12:22,154 INFO L226 Difference]: Without dead ends: 170 [2021-12-06 19:12:22,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:12:22,155 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 98 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:22,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 287 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:12:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-06 19:12:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 95. [2021-12-06 19:12:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.492537313432836) internal successors, (100), 90 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:12:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2021-12-06 19:12:22,158 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 38 [2021-12-06 19:12:22,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:22,158 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2021-12-06 19:12:22,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:22,158 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2021-12-06 19:12:22,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 19:12:22,159 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:22,159 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:12:22,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 19:12:22,159 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:22,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:22,159 INFO L85 PathProgramCache]: Analyzing trace with hash -511950436, now seen corresponding path program 1 times [2021-12-06 19:12:22,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:22,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51270192] [2021-12-06 19:12:22,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:22,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-06 19:12:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-06 19:12:22,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:22,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51270192] [2021-12-06 19:12:22,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51270192] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:22,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925565084] [2021-12-06 19:12:22,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:22,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:22,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:22,220 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:22,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 19:12:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 19:12:22,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 19:12:22,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:12:22,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925565084] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:22,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:12:22,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-06 19:12:22,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547969189] [2021-12-06 19:12:22,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:22,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:12:22,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:22,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:12:22,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:12:22,343 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 19:12:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:22,350 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2021-12-06 19:12:22,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 19:12:22,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2021-12-06 19:12:22,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:22,351 INFO L225 Difference]: With dead ends: 83 [2021-12-06 19:12:22,352 INFO L226 Difference]: Without dead ends: 83 [2021-12-06 19:12:22,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:12:22,352 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 126 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:22,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 95 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:12:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-06 19:12:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-12-06 19:12:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 79 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2021-12-06 19:12:22,356 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 41 [2021-12-06 19:12:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:22,356 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2021-12-06 19:12:22,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 19:12:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2021-12-06 19:12:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-06 19:12:22,357 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:22,357 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] [2021-12-06 19:12:22,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 19:12:22,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 19:12:22,558 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:22,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1002116999, now seen corresponding path program 1 times [2021-12-06 19:12:22,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:22,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158449760] [2021-12-06 19:12:22,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:22,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 19:12:22,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:22,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158449760] [2021-12-06 19:12:22,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158449760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:22,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:12:22,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 19:12:22,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565184347] [2021-12-06 19:12:22,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:22,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:12:22,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:22,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:12:22,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:12:22,636 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:22,771 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2021-12-06 19:12:22,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 19:12:22,772 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2021-12-06 19:12:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:22,772 INFO L225 Difference]: With dead ends: 108 [2021-12-06 19:12:22,773 INFO L226 Difference]: Without dead ends: 108 [2021-12-06 19:12:22,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:12:22,774 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 289 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:22,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 317 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:12:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-06 19:12:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2021-12-06 19:12:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2021-12-06 19:12:22,778 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 42 [2021-12-06 19:12:22,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:22,778 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2021-12-06 19:12:22,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2021-12-06 19:12:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-06 19:12:22,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:22,779 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] [2021-12-06 19:12:22,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 19:12:22,779 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:22,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1002116998, now seen corresponding path program 1 times [2021-12-06 19:12:22,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:22,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781880705] [2021-12-06 19:12:22,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:22,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 19:12:22,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:22,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781880705] [2021-12-06 19:12:22,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781880705] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:22,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758421816] [2021-12-06 19:12:22,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:22,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:22,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:22,836 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:22,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 19:12:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:22,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 19:12:22,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 19:12:23,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 19:12:23,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758421816] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:12:23,056 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:12:23,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2021-12-06 19:12:23,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847155229] [2021-12-06 19:12:23,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:23,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:12:23,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:23,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:12:23,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:12:23,057 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 19:12:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:23,104 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2021-12-06 19:12:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:12:23,105 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2021-12-06 19:12:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:23,106 INFO L225 Difference]: With dead ends: 108 [2021-12-06 19:12:23,106 INFO L226 Difference]: Without dead ends: 108 [2021-12-06 19:12:23,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:12:23,106 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 148 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:23,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 293 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:12:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-06 19:12:23,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2021-12-06 19:12:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.481012658227848) internal successors, (117), 98 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2021-12-06 19:12:23,109 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 42 [2021-12-06 19:12:23,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:23,109 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2021-12-06 19:12:23,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 19:12:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2021-12-06 19:12:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-06 19:12:23,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:23,110 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 19:12:23,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 19:12:23,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:23,311 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:23,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:23,313 INFO L85 PathProgramCache]: Analyzing trace with hash -960994977, now seen corresponding path program 1 times [2021-12-06 19:12:23,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:23,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311132661] [2021-12-06 19:12:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:23,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:23,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:23,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:23,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:23,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311132661] [2021-12-06 19:12:23,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311132661] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:23,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028596501] [2021-12-06 19:12:23,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:23,613 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:23,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:23,614 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:23,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 19:12:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:23,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-06 19:12:23,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:23,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:12:23,784 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:12:23,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:12:23,821 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-12-06 19:12:23,854 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:23,855 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 35 treesize of output 34 [2021-12-06 19:12:23,912 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:23,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-06 19:12:23,940 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 19:12:23,941 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 31 treesize of output 26 [2021-12-06 19:12:24,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:12:24,035 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 31 treesize of output 26 [2021-12-06 19:12:24,072 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 13 [2021-12-06 19:12:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:24,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:27,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) is different from false [2021-12-06 19:12:27,215 INFO L354 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2021-12-06 19:12:27,215 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 22 treesize of output 21 [2021-12-06 19:12:27,219 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2200) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2201) |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-12-06 19:12:27,228 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:12:27,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2021-12-06 19:12:27,231 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 60 treesize of output 52 [2021-12-06 19:12:27,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-06 19:12:27,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2021-12-06 19:12:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2021-12-06 19:12:27,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028596501] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:12:27,530 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:12:27,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 48 [2021-12-06 19:12:27,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827499605] [2021-12-06 19:12:27,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:27,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-06 19:12:27,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:27,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-06 19:12:27,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2019, Unknown=19, NotChecked=182, Total=2352 [2021-12-06 19:12:27,532 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 49 states, 48 states have (on average 1.875) internal successors, (90), 41 states have internal predecessors, (90), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-06 19:12:28,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:28,604 INFO L93 Difference]: Finished difference Result 220 states and 258 transitions. [2021-12-06 19:12:28,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 19:12:28,604 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.875) internal successors, (90), 41 states have internal predecessors, (90), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 43 [2021-12-06 19:12:28,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:28,606 INFO L225 Difference]: With dead ends: 220 [2021-12-06 19:12:28,606 INFO L226 Difference]: Without dead ends: 220 [2021-12-06 19:12:28,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=359, Invalid=3290, Unknown=19, NotChecked=238, Total=3906 [2021-12-06 19:12:28,607 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 1015 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:28,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1015 Valid, 1680 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1378 Invalid, 0 Unknown, 430 Unchecked, 0.5s Time] [2021-12-06 19:12:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-06 19:12:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 112. [2021-12-06 19:12:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 108 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2021-12-06 19:12:28,611 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 43 [2021-12-06 19:12:28,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:28,612 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2021-12-06 19:12:28,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.875) internal successors, (90), 41 states have internal predecessors, (90), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-06 19:12:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2021-12-06 19:12:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-06 19:12:28,612 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:28,612 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 19:12:28,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 19:12:28,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-12-06 19:12:28,813 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:28,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:28,814 INFO L85 PathProgramCache]: Analyzing trace with hash -960994976, now seen corresponding path program 1 times [2021-12-06 19:12:28,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:28,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081900253] [2021-12-06 19:12:28,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:28,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:29,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:29,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:29,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:29,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081900253] [2021-12-06 19:12:29,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081900253] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:29,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877410863] [2021-12-06 19:12:29,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:29,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:29,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:29,202 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:29,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 19:12:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:29,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 91 conjunts are in the unsatisfiable core [2021-12-06 19:12:29,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:29,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:12:29,590 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:12:29,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:12:29,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 19:12:29,657 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-12-06 19:12:29,660 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-12-06 19:12:29,716 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:29,716 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 45 treesize of output 42 [2021-12-06 19:12:29,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-06 19:12:29,818 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:29,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-06 19:12:29,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-06 19:12:29,862 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 19:12:29,863 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 31 treesize of output 26 [2021-12-06 19:12:29,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:12:29,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 19:12:29,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:12:29,996 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 31 treesize of output 26 [2021-12-06 19:12:30,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:12:30,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 19:12:30,073 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 13 [2021-12-06 19:12:30,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 19:12:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:30,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:32,470 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_main_~s~0#1.offset|) (and (forall ((v_ArrVal_2401 Int) (v_ArrVal_2402 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_main_~s~0#1.base|) .cse0 v_ArrVal_2401) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2402) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_2401 Int)) (<= 0 (+ (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_ArrVal_2401) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))))) is different from false [2021-12-06 19:12:34,492 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_ArrVal_2401 Int) (v_ArrVal_2402 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_dll_circular_create_#res#1.base|) .cse0 v_ArrVal_2401) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 v_ArrVal_2402) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) (forall ((v_ArrVal_2401 Int)) (<= 0 (+ 8 (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_ArrVal_2401) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))) is different from false [2021-12-06 19:12:36,529 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (and (forall ((v_ArrVal_2401 Int) (v_ArrVal_2402 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_ArrVal_2401) |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_ArrVal_2402) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_2401 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_ArrVal_2401) |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-12-06 19:12:37,154 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:12:37,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 90 [2021-12-06 19:12:37,160 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:12:37,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 90 [2021-12-06 19:12:37,164 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 227 [2021-12-06 19:12:37,168 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 770 treesize of output 758 [2021-12-06 19:12:37,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,176 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 708 treesize of output 696 [2021-12-06 19:12:37,180 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,183 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 656 treesize of output 646 [2021-12-06 19:12:37,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,192 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 597 treesize of output 589 [2021-12-06 19:12:37,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,199 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 509 treesize of output 493 [2021-12-06 19:12:37,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,212 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 453 treesize of output 445 [2021-12-06 19:12:37,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 365 treesize of output 349 [2021-12-06 19:12:37,226 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,226 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,228 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 329 treesize of output 325 [2021-12-06 19:12:37,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:37,236 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 315 treesize of output 313 [2021-12-06 19:12:37,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877410863] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:37,671 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:12:37,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2021-12-06 19:12:37,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287147463] [2021-12-06 19:12:37,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:37,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-06 19:12:37,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:37,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-06 19:12:37,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2815, Unknown=5, NotChecked=324, Total=3306 [2021-12-06 19:12:37,673 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand has 43 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 37 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 19:12:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:39,224 INFO L93 Difference]: Finished difference Result 252 states and 309 transitions. [2021-12-06 19:12:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 19:12:39,224 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 37 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2021-12-06 19:12:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:39,225 INFO L225 Difference]: With dead ends: 252 [2021-12-06 19:12:39,225 INFO L226 Difference]: Without dead ends: 252 [2021-12-06 19:12:39,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=351, Invalid=4212, Unknown=5, NotChecked=402, Total=4970 [2021-12-06 19:12:39,227 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 1356 mSDsluCounter, 2338 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:39,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1356 Valid, 2429 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1595 Invalid, 0 Unknown, 147 Unchecked, 0.6s Time] [2021-12-06 19:12:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-06 19:12:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 120. [2021-12-06 19:12:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.4742268041237114) internal successors, (143), 116 states have internal predecessors, (143), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2021-12-06 19:12:39,231 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 43 [2021-12-06 19:12:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:39,231 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2021-12-06 19:12:39,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 37 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 19:12:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2021-12-06 19:12:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-06 19:12:39,232 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:39,232 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] [2021-12-06 19:12:39,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 19:12:39,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:39,433 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:39,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1252304435, now seen corresponding path program 2 times [2021-12-06 19:12:39,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:39,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5808119] [2021-12-06 19:12:39,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:39,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:39,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 19:12:39,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:39,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5808119] [2021-12-06 19:12:39,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5808119] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:39,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168139305] [2021-12-06 19:12:39,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 19:12:39,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:39,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:39,525 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:39,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 19:12:39,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 19:12:39,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:12:39,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 19:12:39,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 19:12:39,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 19:12:39,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168139305] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:12:39,800 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:12:39,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2021-12-06 19:12:39,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511305632] [2021-12-06 19:12:39,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:39,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:12:39,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:39,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:12:39,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:12:39,801 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 19:12:39,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:39,867 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2021-12-06 19:12:39,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 19:12:39,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2021-12-06 19:12:39,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:39,868 INFO L225 Difference]: With dead ends: 112 [2021-12-06 19:12:39,868 INFO L226 Difference]: Without dead ends: 112 [2021-12-06 19:12:39,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-06 19:12:39,869 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 171 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:39,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 283 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:12:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-06 19:12:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2021-12-06 19:12:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 102 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2021-12-06 19:12:39,872 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 46 [2021-12-06 19:12:39,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:39,872 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2021-12-06 19:12:39,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 19:12:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2021-12-06 19:12:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-06 19:12:39,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:39,872 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] [2021-12-06 19:12:39,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-06 19:12:40,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-06 19:12:40,074 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:40,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:40,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1996676750, now seen corresponding path program 2 times [2021-12-06 19:12:40,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:40,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508679632] [2021-12-06 19:12:40,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:40,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:40,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:40,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 19:12:40,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:40,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508679632] [2021-12-06 19:12:40,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508679632] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:40,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580987136] [2021-12-06 19:12:40,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 19:12:40,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:40,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:40,173 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:40,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 19:12:40,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-06 19:12:40,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:12:40,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-06 19:12:40,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 19:12:40,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:12:40,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580987136] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:40,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:12:40,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2021-12-06 19:12:40,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493924061] [2021-12-06 19:12:40,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:40,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:12:40,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:40,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:12:40,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-12-06 19:12:40,409 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:40,574 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2021-12-06 19:12:40,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 19:12:40,574 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2021-12-06 19:12:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:40,575 INFO L225 Difference]: With dead ends: 147 [2021-12-06 19:12:40,575 INFO L226 Difference]: Without dead ends: 147 [2021-12-06 19:12:40,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-12-06 19:12:40,576 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 426 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:40,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 276 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:12:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-06 19:12:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2021-12-06 19:12:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 102 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2021-12-06 19:12:40,579 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 47 [2021-12-06 19:12:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:40,579 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2021-12-06 19:12:40,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:40,580 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2021-12-06 19:12:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-06 19:12:40,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:40,580 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] [2021-12-06 19:12:40,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 19:12:40,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:40,781 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:40,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:40,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1996676805, now seen corresponding path program 1 times [2021-12-06 19:12:40,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:40,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611265600] [2021-12-06 19:12:40,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:40,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:40,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 19:12:40,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:40,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611265600] [2021-12-06 19:12:40,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611265600] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:40,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:12:40,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:12:40,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192285590] [2021-12-06 19:12:40,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:40,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:12:40,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:40,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:12:40,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:12:40,863 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:40,907 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-12-06 19:12:40,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:12:40,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2021-12-06 19:12:40,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:40,908 INFO L225 Difference]: With dead ends: 103 [2021-12-06 19:12:40,908 INFO L226 Difference]: Without dead ends: 103 [2021-12-06 19:12:40,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:12:40,909 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 19 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:40,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 262 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:12:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-06 19:12:40,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2021-12-06 19:12:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 97 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2021-12-06 19:12:40,911 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 47 [2021-12-06 19:12:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:40,911 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2021-12-06 19:12:40,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2021-12-06 19:12:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-06 19:12:40,912 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:40,912 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] [2021-12-06 19:12:40,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-06 19:12:40,912 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:40,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:40,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1716069023, now seen corresponding path program 1 times [2021-12-06 19:12:40,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:40,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859088964] [2021-12-06 19:12:40,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:40,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:40,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:40,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 19:12:40,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:40,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859088964] [2021-12-06 19:12:40,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859088964] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:40,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349618793] [2021-12-06 19:12:40,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:40,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:40,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:40,972 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:40,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 19:12:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:41,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 19:12:41,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 19:12:41,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 19:12:41,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349618793] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:12:41,212 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:12:41,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2021-12-06 19:12:41,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906234448] [2021-12-06 19:12:41,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:41,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:12:41,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:41,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:12:41,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:12:41,213 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:41,281 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2021-12-06 19:12:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:12:41,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2021-12-06 19:12:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:41,282 INFO L225 Difference]: With dead ends: 99 [2021-12-06 19:12:41,282 INFO L226 Difference]: Without dead ends: 99 [2021-12-06 19:12:41,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:12:41,283 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 59 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:41,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 404 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:12:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-06 19:12:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2021-12-06 19:12:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 93 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-12-06 19:12:41,285 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 51 [2021-12-06 19:12:41,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:41,285 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-12-06 19:12:41,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-12-06 19:12:41,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-06 19:12:41,286 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:41,286 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:12:41,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 19:12:41,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-06 19:12:41,487 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:41,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:41,488 INFO L85 PathProgramCache]: Analyzing trace with hash -291844745, now seen corresponding path program 3 times [2021-12-06 19:12:41,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:41,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138397553] [2021-12-06 19:12:41,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:41,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:41,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:41,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 19:12:41,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:41,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138397553] [2021-12-06 19:12:41,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138397553] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:41,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373348025] [2021-12-06 19:12:41,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 19:12:41,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:41,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:41,666 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:41,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 19:12:42,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-06 19:12:42,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:12:42,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 19:12:42,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 19:12:42,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:12:42,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373348025] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:12:42,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:12:42,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2021-12-06 19:12:42,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123145242] [2021-12-06 19:12:42,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:12:42,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:12:42,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:42,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:12:42,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:12:42,300 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:42,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:42,320 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2021-12-06 19:12:42,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:12:42,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2021-12-06 19:12:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:42,321 INFO L225 Difference]: With dead ends: 93 [2021-12-06 19:12:42,321 INFO L226 Difference]: Without dead ends: 93 [2021-12-06 19:12:42,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:12:42,322 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 89 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:42,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 165 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:12:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-06 19:12:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-12-06 19:12:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 87 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-12-06 19:12:42,325 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 51 [2021-12-06 19:12:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:42,325 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-12-06 19:12:42,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-12-06 19:12:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-06 19:12:42,326 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:42,326 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] [2021-12-06 19:12:42,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 19:12:42,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-06 19:12:42,527 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:42,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:42,527 INFO L85 PathProgramCache]: Analyzing trace with hash 878531443, now seen corresponding path program 1 times [2021-12-06 19:12:42,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:42,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679274075] [2021-12-06 19:12:42,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:42,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:43,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:43,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:43,093 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:43,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:43,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679274075] [2021-12-06 19:12:43,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679274075] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:43,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316579869] [2021-12-06 19:12:43,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:43,094 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:43,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:43,095 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:43,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 19:12:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:43,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 105 conjunts are in the unsatisfiable core [2021-12-06 19:12:43,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:43,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:12:43,387 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:12:43,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 11 treesize of output 11 [2021-12-06 19:12:43,452 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-12-06 19:12:43,500 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:43,501 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 26 treesize of output 27 [2021-12-06 19:12:43,577 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:43,577 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 19 treesize of output 22 [2021-12-06 19:12:43,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:12:43,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-06 19:12:43,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 19:12:43,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:12:43,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-06 19:12:43,840 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 16 treesize of output 8 [2021-12-06 19:12:43,921 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 16 treesize of output 18 [2021-12-06 19:12:44,044 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-12-06 19:12:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:12:44,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:44,246 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3483 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_3483 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))))) is different from false [2021-12-06 19:12:44,256 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3483 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_3483 (Array Int 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| v_ArrVal_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))))) is different from false [2021-12-06 19:12:44,262 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3483 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) (forall ((v_ArrVal_3483 (Array Int Int))) (<= (select (select (store |c_#memory_int| (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|) v_ArrVal_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-06 19:12:44,273 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3483 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_3483 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))))) is different from false [2021-12-06 19:12:44,287 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:12:44,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-06 19:12:44,293 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:12:44,294 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 64 treesize of output 67 [2021-12-06 19:12:44,297 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 25 treesize of output 21 [2021-12-06 19:12:44,331 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:12:44,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-06 19:12:44,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:12:44,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2021-12-06 19:12:44,345 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 25 treesize of output 21 [2021-12-06 19:12:44,530 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3481 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3476) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 8) v_ArrVal_3481) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-06 19:12:44,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3481 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3476) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_3481) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-06 19:12:44,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3481 Int)) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3475) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3476) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_3481) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2021-12-06 19:12:44,551 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:12:44,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-06 19:12:44,555 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 171 treesize of output 165 [2021-12-06 19:12:44,558 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 191 treesize of output 185 [2021-12-06 19:12:44,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-06 19:12:44,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-06 19:12:44,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-06 19:12:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-06 19:12:44,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316579869] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:12:44,976 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:12:44,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 28] total 75 [2021-12-06 19:12:44,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326515888] [2021-12-06 19:12:44,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:44,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2021-12-06 19:12:44,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:44,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-12-06 19:12:44,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4316, Unknown=7, NotChecked=966, Total=5550 [2021-12-06 19:12:44,980 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 75 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 66 states have internal predecessors, (132), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-06 19:12:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:46,159 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2021-12-06 19:12:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-06 19:12:46,159 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 66 states have internal predecessors, (132), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 54 [2021-12-06 19:12:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:46,160 INFO L225 Difference]: With dead ends: 91 [2021-12-06 19:12:46,160 INFO L226 Difference]: Without dead ends: 91 [2021-12-06 19:12:46,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 88 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1846 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=473, Invalid=6354, Unknown=7, NotChecked=1176, Total=8010 [2021-12-06 19:12:46,163 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 130 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 742 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:46,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 1714 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1190 Invalid, 0 Unknown, 742 Unchecked, 0.4s Time] [2021-12-06 19:12:46,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-06 19:12:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-06 19:12:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 87 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2021-12-06 19:12:46,166 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 54 [2021-12-06 19:12:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:46,166 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2021-12-06 19:12:46,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 66 states have internal predecessors, (132), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-06 19:12:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2021-12-06 19:12:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 19:12:46,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:46,167 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] [2021-12-06 19:12:46,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-06 19:12:46,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-06 19:12:46,369 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:46,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:46,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1199894254, now seen corresponding path program 1 times [2021-12-06 19:12:46,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:46,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339264111] [2021-12-06 19:12:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:46,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:46,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:46,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 19:12:46,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:46,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339264111] [2021-12-06 19:12:46,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339264111] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:46,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200005971] [2021-12-06 19:12:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:46,556 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:46,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:46,557 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:46,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 19:12:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:46,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-06 19:12:46,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 19:12:46,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 19:12:47,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200005971] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:12:47,117 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:12:47,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2021-12-06 19:12:47,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95284324] [2021-12-06 19:12:47,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:47,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-06 19:12:47,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:47,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-06 19:12:47,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2021-12-06 19:12:47,118 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 29 states, 28 states have (on average 4.107142857142857) internal successors, (115), 25 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 19:12:47,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:47,366 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2021-12-06 19:12:47,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 19:12:47,366 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.107142857142857) internal successors, (115), 25 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2021-12-06 19:12:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:47,367 INFO L225 Difference]: With dead ends: 125 [2021-12-06 19:12:47,367 INFO L226 Difference]: Without dead ends: 125 [2021-12-06 19:12:47,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2021-12-06 19:12:47,368 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 733 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:47,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [733 Valid, 412 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:12:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-06 19:12:47,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2021-12-06 19:12:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 87 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2021-12-06 19:12:47,371 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 57 [2021-12-06 19:12:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:47,371 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2021-12-06 19:12:47,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.107142857142857) internal successors, (115), 25 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 19:12:47,371 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2021-12-06 19:12:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-06 19:12:47,371 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:47,371 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:12:47,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-06 19:12:47,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-06 19:12:47,572 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:47,573 INFO L85 PathProgramCache]: Analyzing trace with hash 963119259, now seen corresponding path program 1 times [2021-12-06 19:12:47,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:47,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055875387] [2021-12-06 19:12:47,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:47,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:47,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:47,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:12:47,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:47,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055875387] [2021-12-06 19:12:47,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055875387] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:47,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683794929] [2021-12-06 19:12:47,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:47,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:47,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:47,977 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:47,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-06 19:12:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:48,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 77 conjunts are in the unsatisfiable core [2021-12-06 19:12:48,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:48,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:12:48,191 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:12:48,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:12:48,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 19:12:48,265 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:48,265 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 35 treesize of output 34 [2021-12-06 19:12:48,326 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:48,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-06 19:12:48,357 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 19:12:48,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2021-12-06 19:12:48,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:12:48,431 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 31 treesize of output 26 [2021-12-06 19:12:48,540 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:48,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-06 19:12:48,598 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 13 [2021-12-06 19:12:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 19:12:48,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:48,625 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3878 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3878) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2021-12-06 19:12:48,633 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3878 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3878) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2021-12-06 19:12:48,703 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3878 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3878) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2021-12-06 19:12:48,711 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3877 Int) (v_ArrVal_3878 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (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_ArrVal_3877)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3878)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2021-12-06 19:12:48,724 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3877 Int) (v_ArrVal_3878 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (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_ArrVal_3877))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3878)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-06 19:12:48,735 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3877 Int) (v_ArrVal_3878 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (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_ArrVal_3877))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3878)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) 1) (< |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-12-06 19:12:48,749 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3877 Int) (v_ArrVal_3878 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (let ((.cse0 (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_ArrVal_3877))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3878)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2021-12-06 19:12:49,156 INFO L354 Elim1Store]: treesize reduction 5, result has 91.9 percent of original size [2021-12-06 19:12:49,156 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 66 treesize of output 65 [2021-12-06 19:12:49,166 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3877 Int) (v_ArrVal_3872 (Array Int Int)) (v_ArrVal_3874 Int) (v_ArrVal_3873 (Array Int Int)) (v_ArrVal_3878 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3872) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3873))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_3874) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3877))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3878))) |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|))) is different from false [2021-12-06 19:12:49,184 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:12:49,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 66 [2021-12-06 19:12:49,188 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 260 treesize of output 252 [2021-12-06 19:12:49,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:49,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:49,195 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 100 treesize of output 92 [2021-12-06 19:12:49,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:49,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:49,208 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 92 treesize of output 86 [2021-12-06 19:12:49,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:49,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:49,211 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 106 treesize of output 94 [2021-12-06 19:12:49,214 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 94 treesize of output 86 [2021-12-06 19:12:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2021-12-06 19:12:49,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683794929] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:12:49,549 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:12:49,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 26] total 60 [2021-12-06 19:12:49,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558126441] [2021-12-06 19:12:49,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:49,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-12-06 19:12:49,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:49,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-12-06 19:12:49,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2506, Unknown=103, NotChecked=872, Total=3660 [2021-12-06 19:12:49,552 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 61 states, 60 states have (on average 2.1333333333333333) internal successors, (128), 53 states have internal predecessors, (128), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-06 19:12:49,907 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse1 (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|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3877 Int) (v_ArrVal_3878 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (let ((.cse0 (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_ArrVal_3877))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3878)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (not (= 0 .cse2)) (= .cse2 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (= (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) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)))) is different from false [2021-12-06 19:12:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:50,522 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2021-12-06 19:12:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 19:12:50,522 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.1333333333333333) internal successors, (128), 53 states have internal predecessors, (128), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2021-12-06 19:12:50,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:50,523 INFO L225 Difference]: With dead ends: 150 [2021-12-06 19:12:50,523 INFO L226 Difference]: Without dead ends: 150 [2021-12-06 19:12:50,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 89 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=318, Invalid=3870, Unknown=138, NotChecked=1224, Total=5550 [2021-12-06 19:12:50,525 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 427 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1037 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:50,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 1498 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1208 Invalid, 0 Unknown, 1037 Unchecked, 0.4s Time] [2021-12-06 19:12:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-06 19:12:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 95. [2021-12-06 19:12:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 91 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-12-06 19:12:50,528 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 60 [2021-12-06 19:12:50,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:50,528 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-12-06 19:12:50,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.1333333333333333) internal successors, (128), 53 states have internal predecessors, (128), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-06 19:12:50,528 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-12-06 19:12:50,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-06 19:12:50,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:50,528 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:12:50,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-06 19:12:50,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-06 19:12:50,730 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:50,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:50,731 INFO L85 PathProgramCache]: Analyzing trace with hash 963119260, now seen corresponding path program 1 times [2021-12-06 19:12:50,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:50,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416463284] [2021-12-06 19:12:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:50,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:51,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:51,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:12:51,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:51,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416463284] [2021-12-06 19:12:51,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416463284] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:51,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30852961] [2021-12-06 19:12:51,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:51,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:51,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:51,306 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:51,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-06 19:12:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:51,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 105 conjunts are in the unsatisfiable core [2021-12-06 19:12:51,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:51,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:12:51,680 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 19:12:51,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-06 19:12:51,690 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:12:51,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:12:51,757 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-12-06 19:12:51,762 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-12-06 19:12:51,811 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:51,811 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 45 treesize of output 42 [2021-12-06 19:12:51,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-06 19:12:51,903 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:51,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-06 19:12:51,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-06 19:12:51,947 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 19:12:51,947 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 31 treesize of output 26 [2021-12-06 19:12:51,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:12:51,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 19:12:52,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:12:52,047 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 31 treesize of output 26 [2021-12-06 19:12:52,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:12:52,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 19:12:52,196 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:52,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-06 19:12:52,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-06 19:12:52,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-06 19:12:52,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 19:12:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 19:12:52,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:52,461 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4091) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_4090 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-06 19:12:52,471 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4091) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_4090 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) is different from false [2021-12-06 19:12:52,479 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int))) (let ((.cse0 (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|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4091) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_4090 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (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|) v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) is different from false [2021-12-06 19:12:52,491 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4091) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_4090 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) is different from false [2021-12-06 19:12:52,509 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (let ((.cse2 (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_ArrVal_4088)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_4086)) .cse1 v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4091) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (<= 0 (+ (select (select (let ((.cse3 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (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|) .cse3 v_ArrVal_4086)) (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|) .cse3 v_ArrVal_4088)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4090)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) is different from false [2021-12-06 19:12:52,541 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (<= 0 (+ 8 (select (select (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_4086)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_4088) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4090)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_4088))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_4086)) .cse2 v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3) .cse2 v_ArrVal_4091) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))))) is different from false [2021-12-06 19:12:52,566 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (<= 0 (+ (select (select (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (store (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|) .cse0 v_ArrVal_4086)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 v_ArrVal_4088) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_4090)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8))) (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse1 v_ArrVal_4088))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (<= (+ (select (select (store (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|) .cse1 v_ArrVal_4086)) .cse2 v_ArrVal_4090) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse3) .cse2 v_ArrVal_4091) |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_32| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2021-12-06 19:12:52,592 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (<= 0 (+ 8 (select (select (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (store (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|) .cse0 v_ArrVal_4086)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_4088) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4090)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_4088))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (<= (+ 12 (select (select (store (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|) .cse1 v_ArrVal_4086)) .cse2 v_ArrVal_4090) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3) .cse2 v_ArrVal_4091) |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-12-06 19:12:52,626 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (and (forall ((v_ArrVal_4084 Int) (v_ArrVal_4085 Int) (v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (<= 0 (+ 8 (select (select (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (store (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|) .cse0 v_ArrVal_4084) .cse1 v_ArrVal_4086)) (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_4085) .cse1 v_ArrVal_4088) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4090)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_4084 Int) (v_ArrVal_4085 Int) (v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (let ((.cse5 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_4085) .cse3 v_ArrVal_4088))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (<= (+ 12 (select (select (store (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|) .cse2 v_ArrVal_4084) .cse3 v_ArrVal_4086)) .cse4 v_ArrVal_4090) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse5) .cse4 v_ArrVal_4091) |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_update_at_~head#1.offset_32| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-06 19:12:53,208 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:12:53,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 224 [2021-12-06 19:12:53,215 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 1836 treesize of output 1828 [2021-12-06 19:12:53,226 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:12:53,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1828 treesize of output 1452 [2021-12-06 19:12:53,236 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 5308 treesize of output 5210 [2021-12-06 19:12:53,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,257 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 4730 treesize of output 4632 [2021-12-06 19:12:53,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,277 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 4532 treesize of output 4510 [2021-12-06 19:12:53,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,313 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 4341 treesize of output 4309 [2021-12-06 19:12:53,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,331 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 4229 treesize of output 4213 [2021-12-06 19:12:53,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,349 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 3893 treesize of output 3829 [2021-12-06 19:12:53,364 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,367 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 3509 treesize of output 3445 [2021-12-06 19:12:53,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,385 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 3285 treesize of output 3253 [2021-12-06 19:12:53,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,406 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 2613 treesize of output 2485 [2021-12-06 19:12:53,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,423 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 2465 treesize of output 2461 [2021-12-06 19:12:53,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:12:53,439 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 2421 treesize of output 2413 [2021-12-06 19:12:53,465 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 886 treesize of output 870 [2021-12-06 19:12:53,617 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 1526 treesize of output 1462 [2021-12-06 19:12:53,633 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 1462 treesize of output 1398 [2021-12-06 19:12:53,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30852961] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:53,994 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:12:53,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 45 [2021-12-06 19:12:53,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223400334] [2021-12-06 19:12:53,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:53,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-06 19:12:53,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:53,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-06 19:12:53,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2908, Unknown=12, NotChecked=1044, Total=4160 [2021-12-06 19:12:53,996 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 46 states, 45 states have (on average 2.2888888888888888) internal successors, (103), 41 states have internal predecessors, (103), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 19:12:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:55,276 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2021-12-06 19:12:55,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 19:12:55,276 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.2888888888888888) internal successors, (103), 41 states have internal predecessors, (103), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2021-12-06 19:12:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:55,277 INFO L225 Difference]: With dead ends: 162 [2021-12-06 19:12:55,277 INFO L226 Difference]: Without dead ends: 162 [2021-12-06 19:12:55,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=413, Invalid=4723, Unknown=12, NotChecked=1332, Total=6480 [2021-12-06 19:12:55,279 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 411 mSDsluCounter, 1959 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:55,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 2041 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1260 Invalid, 0 Unknown, 83 Unchecked, 0.5s Time] [2021-12-06 19:12:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-06 19:12:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 94. [2021-12-06 19:12:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 90 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2021-12-06 19:12:55,282 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 60 [2021-12-06 19:12:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:55,282 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2021-12-06 19:12:55,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.2888888888888888) internal successors, (103), 41 states have internal predecessors, (103), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 19:12:55,282 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2021-12-06 19:12:55,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-06 19:12:55,283 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:55,283 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:12:55,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-06 19:12:55,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:55,484 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash -258644372, now seen corresponding path program 1 times [2021-12-06 19:12:55,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:55,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709522614] [2021-12-06 19:12:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:55,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:55,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:55,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 19:12:55,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:55,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709522614] [2021-12-06 19:12:55,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709522614] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:55,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409997876] [2021-12-06 19:12:55,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:55,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:55,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:55,575 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:55,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-06 19:12:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:55,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 19:12:55,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 19:12:55,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 19:12:55,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409997876] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:12:55,802 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:12:55,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-12-06 19:12:55,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496690488] [2021-12-06 19:12:55,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:55,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:12:55,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:55,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:12:55,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:12:55,803 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:55,855 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-12-06 19:12:55,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:12:55,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2021-12-06 19:12:55,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:55,856 INFO L225 Difference]: With dead ends: 94 [2021-12-06 19:12:55,856 INFO L226 Difference]: Without dead ends: 94 [2021-12-06 19:12:55,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:12:55,856 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 63 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:55,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 294 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:12:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-06 19:12:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-06 19:12:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 90 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2021-12-06 19:12:55,859 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 61 [2021-12-06 19:12:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:55,859 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-12-06 19:12:55,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:12:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2021-12-06 19:12:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-06 19:12:55,859 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:55,859 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:12:55,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-06 19:12:56,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:56,061 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:56,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:56,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1906011450, now seen corresponding path program 2 times [2021-12-06 19:12:56,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:56,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299336840] [2021-12-06 19:12:56,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:56,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:56,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:56,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 19:12:56,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:56,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299336840] [2021-12-06 19:12:56,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299336840] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:56,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059290552] [2021-12-06 19:12:56,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 19:12:56,169 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:56,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:56,169 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:56,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-06 19:12:56,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 19:12:56,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:12:56,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 19:12:56,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 19:12:56,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 19:12:56,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059290552] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:12:56,561 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:12:56,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2021-12-06 19:12:56,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519919585] [2021-12-06 19:12:56,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:12:56,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:12:56,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:12:56,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:12:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:12:56,562 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 19:12:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:12:56,631 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2021-12-06 19:12:56,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:12:56,632 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 63 [2021-12-06 19:12:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:12:56,632 INFO L225 Difference]: With dead ends: 85 [2021-12-06 19:12:56,632 INFO L226 Difference]: Without dead ends: 85 [2021-12-06 19:12:56,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-12-06 19:12:56,633 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 98 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:12:56,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 287 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:12:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-06 19:12:56,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-12-06 19:12:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 81 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:12:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2021-12-06 19:12:56,635 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 63 [2021-12-06 19:12:56,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:12:56,635 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2021-12-06 19:12:56,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 19:12:56,635 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2021-12-06 19:12:56,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-06 19:12:56,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:12:56,636 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:12:56,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-06 19:12:56,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-12-06 19:12:56,836 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:12:56,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:12:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1093757523, now seen corresponding path program 1 times [2021-12-06 19:12:56,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:12:56,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926985865] [2021-12-06 19:12:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:56,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:12:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:57,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:12:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:57,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:12:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:12:57,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:12:57,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926985865] [2021-12-06 19:12:57,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926985865] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:12:57,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275100389] [2021-12-06 19:12:57,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:12:57,534 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:12:57,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:12:57,536 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:12:57,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-06 19:12:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:12:57,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 110 conjunts are in the unsatisfiable core [2021-12-06 19:12:57,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:12:57,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:12:57,868 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:12:57,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:12:57,918 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-12-06 19:12:57,961 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:57,961 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 26 treesize of output 27 [2021-12-06 19:12:58,022 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:58,022 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 19 treesize of output 22 [2021-12-06 19:12:58,051 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 19:12:58,051 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 22 treesize of output 21 [2021-12-06 19:12:58,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:12:58,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-06 19:12:58,315 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:12:58,316 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 56 treesize of output 53 [2021-12-06 19:12:58,318 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 27 treesize of output 19 [2021-12-06 19:12:58,319 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 30 treesize of output 32 [2021-12-06 19:12:58,522 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 21 [2021-12-06 19:12:58,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-06 19:12:58,591 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-12-06 19:12:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:12:58,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:12:58,893 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 84 treesize of output 64 [2021-12-06 19:12:58,906 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_4680 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (forall ((v_ArrVal_4683 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4683) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) is different from false [2021-12-06 19:12:58,919 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4680 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_4683 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4683) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset|))) is different from false [2021-12-06 19:12:58,927 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:12:58,927 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 38 treesize of output 37 [2021-12-06 19:12:58,929 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 13 treesize of output 11 [2021-12-06 19:13:01,091 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_ArrVal_4679 Int)) (not (= (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_ArrVal_4679) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-06 19:13:03,101 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (forall ((v_ArrVal_4679 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_ArrVal_4679) |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-12-06 19:13:03,549 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4679 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_ArrVal_4679) |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-12-06 19:13:03,616 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4675 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4675) |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|))) is different from false [2021-12-06 19:13:03,620 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4675 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4675) |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_~new_head~0#1.base|))) is different from false [2021-12-06 19:13:03,623 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4674 (Array Int Int)) (v_ArrVal_4675 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4674) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4675) |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-12-06 19:13:03,628 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:13:03,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-06 19:13:03,630 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 65 treesize of output 57 [2021-12-06 19:13:03,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-06 19:13:03,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-06 19:13:03,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-06 19:13:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-12-06 19:13:03,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275100389] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:13:03,951 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:13:03,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 33] total 80 [2021-12-06 19:13:03,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922980341] [2021-12-06 19:13:03,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:13:03,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2021-12-06 19:13:03,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:13:03,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-12-06 19:13:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=4907, Unknown=8, NotChecked=1176, Total=6320 [2021-12-06 19:13:03,954 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand has 80 states, 80 states have (on average 1.9375) internal successors, (155), 71 states have internal predecessors, (155), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-06 19:13:05,010 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (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|)) (.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|))) (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|)) (= (select (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|) 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (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$.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_ArrVal_4679 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_ArrVal_4679) |c_ULTIMATE.start_dll_circular_create_~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| .cse1)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#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-12-06 19:13:05,452 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (forall ((v_ArrVal_4679 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_ArrVal_4679) |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|))) (= 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 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) is different from false [2021-12-06 19:13:05,891 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (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_ArrVal_4679 Int)) (not (= (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_ArrVal_4679) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)) is different from false [2021-12-06 19:13:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:13:07,318 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2021-12-06 19:13:07,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-06 19:13:07,318 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.9375) internal successors, (155), 71 states have internal predecessors, (155), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 64 [2021-12-06 19:13:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:13:07,319 INFO L225 Difference]: With dead ends: 83 [2021-12-06 19:13:07,319 INFO L226 Difference]: Without dead ends: 83 [2021-12-06 19:13:07,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 77 SyntacticMatches, 12 SemanticMatches, 102 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=487, Invalid=8102, Unknown=11, NotChecked=2112, Total=10712 [2021-12-06 19:13:07,320 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 319 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 696 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 19:13:07,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 1872 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1726 Invalid, 0 Unknown, 696 Unchecked, 0.7s Time] [2021-12-06 19:13:07,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-06 19:13:07,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-12-06 19:13:07,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.173913043478261) internal successors, (81), 79 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:13:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2021-12-06 19:13:07,322 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 64 [2021-12-06 19:13:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:13:07,322 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2021-12-06 19:13:07,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 1.9375) internal successors, (155), 71 states have internal predecessors, (155), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-06 19:13:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2021-12-06 19:13:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-06 19:13:07,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:13:07,323 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:13:07,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-12-06 19:13:07,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-06 19:13:07,524 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:13:07,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:13:07,525 INFO L85 PathProgramCache]: Analyzing trace with hash -434627805, now seen corresponding path program 1 times [2021-12-06 19:13:07,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:13:07,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69352142] [2021-12-06 19:13:07,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:13:07,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:13:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:13:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:07,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:13:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-06 19:13:07,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:13:07,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69352142] [2021-12-06 19:13:07,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69352142] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:13:07,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:13:07,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 19:13:07,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28948397] [2021-12-06 19:13:07,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:13:07,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:13:07,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:13:07,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:13:07,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:13:07,642 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:13:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:13:07,777 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2021-12-06 19:13:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 19:13:07,778 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2021-12-06 19:13:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:13:07,778 INFO L225 Difference]: With dead ends: 101 [2021-12-06 19:13:07,778 INFO L226 Difference]: Without dead ends: 101 [2021-12-06 19:13:07,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:13:07,779 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 187 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:13:07,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 266 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:13:07,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-06 19:13:07,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2021-12-06 19:13:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 82 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:13:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2021-12-06 19:13:07,781 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 68 [2021-12-06 19:13:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:13:07,781 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2021-12-06 19:13:07,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:13:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2021-12-06 19:13:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-06 19:13:07,782 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:13:07,782 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:13:07,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-06 19:13:07,782 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:13:07,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:13:07,782 INFO L85 PathProgramCache]: Analyzing trace with hash -434627804, now seen corresponding path program 1 times [2021-12-06 19:13:07,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:13:07,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005201128] [2021-12-06 19:13:07,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:13:07,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:13:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:07,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:13:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:07,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:13:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 19:13:07,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:13:07,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005201128] [2021-12-06 19:13:07,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005201128] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:13:07,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:13:07,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 19:13:07,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608921210] [2021-12-06 19:13:07,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:13:07,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:13:07,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:13:07,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:13:07,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:13:07,900 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:13:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:13:08,060 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2021-12-06 19:13:08,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 19:13:08,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2021-12-06 19:13:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:13:08,061 INFO L225 Difference]: With dead ends: 84 [2021-12-06 19:13:08,061 INFO L226 Difference]: Without dead ends: 84 [2021-12-06 19:13:08,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:13:08,061 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 192 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:13:08,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 209 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:13:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-06 19:13:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-06 19:13:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 80 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:13:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2021-12-06 19:13:08,063 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 68 [2021-12-06 19:13:08,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:13:08,064 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2021-12-06 19:13:08,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:13:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2021-12-06 19:13:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:13:08,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:13:08,064 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:13:08,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-06 19:13:08,065 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:13:08,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:13:08,065 INFO L85 PathProgramCache]: Analyzing trace with hash -588526179, now seen corresponding path program 1 times [2021-12-06 19:13:08,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:13:08,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124302664] [2021-12-06 19:13:08,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:13:08,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:13:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:08,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:13:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:08,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:13:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 19:13:08,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:13:08,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124302664] [2021-12-06 19:13:08,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124302664] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:13:08,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:13:08,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 19:13:08,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591812684] [2021-12-06 19:13:08,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:13:08,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:13:08,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:13:08,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:13:08,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:13:08,145 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:13:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:13:08,257 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2021-12-06 19:13:08,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 19:13:08,258 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2021-12-06 19:13:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:13:08,258 INFO L225 Difference]: With dead ends: 84 [2021-12-06 19:13:08,258 INFO L226 Difference]: Without dead ends: 84 [2021-12-06 19:13:08,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:13:08,259 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 188 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:13:08,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 267 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:13:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-06 19:13:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-06 19:13:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 80 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:13:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2021-12-06 19:13:08,261 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 69 [2021-12-06 19:13:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:13:08,261 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2021-12-06 19:13:08,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:13:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2021-12-06 19:13:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-06 19:13:08,262 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:13:08,262 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:13:08,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-06 19:13:08,262 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:13:08,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:13:08,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1329551323, now seen corresponding path program 1 times [2021-12-06 19:13:08,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:13:08,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874600978] [2021-12-06 19:13:08,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:13:08,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:13:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:08,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:13:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:13:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 19:13:08,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:13:08,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874600978] [2021-12-06 19:13:08,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874600978] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:13:08,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162299232] [2021-12-06 19:13:08,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:13:08,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:13:08,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:13:08,338 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:13:08,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-06 19:13:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:08,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-06 19:13:08,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:13:08,709 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 17 treesize of output 9 [2021-12-06 19:13:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 19:13:08,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:13:08,773 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-06 19:13:08,773 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-12-06 19:13:08,814 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-06 19:13:08,814 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-12-06 19:13:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 19:13:08,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162299232] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:13:08,873 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:13:08,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 8] total 26 [2021-12-06 19:13:08,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762135234] [2021-12-06 19:13:08,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:13:08,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-06 19:13:08,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:13:08,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-06 19:13:08,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2021-12-06 19:13:08,874 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 27 states, 26 states have (on average 4.538461538461538) internal successors, (118), 25 states have internal predecessors, (118), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-06 19:13:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:13:09,226 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2021-12-06 19:13:09,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-06 19:13:09,227 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.538461538461538) internal successors, (118), 25 states have internal predecessors, (118), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2021-12-06 19:13:09,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:13:09,227 INFO L225 Difference]: With dead ends: 92 [2021-12-06 19:13:09,227 INFO L226 Difference]: Without dead ends: 92 [2021-12-06 19:13:09,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2021-12-06 19:13:09,228 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 313 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:13:09,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 559 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:13:09,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-06 19:13:09,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2021-12-06 19:13:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.135135135135135) internal successors, (84), 80 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:13:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2021-12-06 19:13:09,230 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 71 [2021-12-06 19:13:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:13:09,230 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2021-12-06 19:13:09,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.538461538461538) internal successors, (118), 25 states have internal predecessors, (118), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-06 19:13:09,230 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2021-12-06 19:13:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-06 19:13:09,231 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:13:09,231 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:13:09,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-12-06 19:13:09,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-12-06 19:13:09,432 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:13:09,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:13:09,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1329551324, now seen corresponding path program 1 times [2021-12-06 19:13:09,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:13:09,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496528739] [2021-12-06 19:13:09,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:13:09,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:13:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:09,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:13:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:09,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:13:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:13:09,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:13:09,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496528739] [2021-12-06 19:13:09,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496528739] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:13:09,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124135516] [2021-12-06 19:13:09,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:13:09,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:13:09,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:13:09,929 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:13:09,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-06 19:13:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:10,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 121 conjunts are in the unsatisfiable core [2021-12-06 19:13:10,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:13:10,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:13:10,288 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:13:10,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:13:10,357 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-12-06 19:13:10,360 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-12-06 19:13:10,417 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:13:10,417 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 36 treesize of output 35 [2021-12-06 19:13:10,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-06 19:13:10,509 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:13:10,509 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 29 treesize of output 30 [2021-12-06 19:13:10,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-06 19:13:10,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:10,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 19:13:10,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:10,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-06 19:13:10,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:10,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:10,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:10,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-06 19:13:10,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:10,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-06 19:13:10,829 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 16 treesize of output 8 [2021-12-06 19:13:10,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-06 19:13:11,330 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-12-06 19:13:11,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:11,333 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:13:11,334 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 35 treesize of output 17 [2021-12-06 19:13:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:13:11,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:13:11,625 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:13:11,625 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-12-06 19:13:11,769 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:13:11,769 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 28 treesize of output 32 [2021-12-06 19:13:12,805 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:13:12,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 74 [2021-12-06 19:13:12,808 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 770 treesize of output 764 [2021-12-06 19:13:12,814 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:13:12,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 758 treesize of output 638 [2021-12-06 19:13:12,820 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 3422 treesize of output 3356 [2021-12-06 19:13:12,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:12,838 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:12,839 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 3036 treesize of output 2970 [2021-12-06 19:13:12,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:12,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:12,861 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 2006 treesize of output 1878 [2021-12-06 19:13:12,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:12,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:12,873 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 1558 treesize of output 1494 [2021-12-06 19:13:12,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:12,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:12,884 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 1474 treesize of output 1470 [2021-12-06 19:13:12,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:12,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:12,898 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 722 treesize of output 716 [2021-12-06 19:13:12,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:12,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:12,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1406 treesize of output 1398 [2021-12-06 19:13:12,936 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 1398 treesize of output 1382 [2021-12-06 19:13:13,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124135516] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:13:13,301 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:13:13,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2021-12-06 19:13:13,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107593232] [2021-12-06 19:13:13,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 19:13:13,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-12-06 19:13:13,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:13:13,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-12-06 19:13:13,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=5827, Unknown=35, NotChecked=0, Total=6162 [2021-12-06 19:13:13,302 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 56 states, 55 states have (on average 2.327272727272727) internal successors, (128), 51 states have internal predecessors, (128), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:13:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:13:15,075 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2021-12-06 19:13:15,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 19:13:15,076 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.327272727272727) internal successors, (128), 51 states have internal predecessors, (128), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 71 [2021-12-06 19:13:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:13:15,076 INFO L225 Difference]: With dead ends: 93 [2021-12-06 19:13:15,076 INFO L226 Difference]: Without dead ends: 93 [2021-12-06 19:13:15,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=710, Invalid=9155, Unknown=35, NotChecked=0, Total=9900 [2021-12-06 19:13:15,077 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 527 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 19:13:15,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 1121 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 19:13:15,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-06 19:13:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2021-12-06 19:13:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.118421052631579) internal successors, (85), 82 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:13:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2021-12-06 19:13:15,079 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 71 [2021-12-06 19:13:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:13:15,080 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2021-12-06 19:13:15,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.327272727272727) internal successors, (128), 51 states have internal predecessors, (128), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:13:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2021-12-06 19:13:15,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-06 19:13:15,080 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:13:15,080 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:13:15,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2021-12-06 19:13:15,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-12-06 19:13:15,281 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:13:15,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:13:15,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1733583318, now seen corresponding path program 1 times [2021-12-06 19:13:15,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:13:15,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79665921] [2021-12-06 19:13:15,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:13:15,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:13:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:15,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:13:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:15,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:13:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 19:13:15,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:13:15,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79665921] [2021-12-06 19:13:15,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79665921] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:13:15,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:13:15,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 19:13:15,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784818424] [2021-12-06 19:13:15,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:13:15,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:13:15,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:13:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:13:15,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:13:15,381 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:13:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:13:15,508 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2021-12-06 19:13:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 19:13:15,508 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2021-12-06 19:13:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:13:15,509 INFO L225 Difference]: With dead ends: 85 [2021-12-06 19:13:15,509 INFO L226 Difference]: Without dead ends: 85 [2021-12-06 19:13:15,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:13:15,509 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 173 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:13:15,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 230 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:13:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-06 19:13:15,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-12-06 19:13:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 81 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:13:15,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2021-12-06 19:13:15,511 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 72 [2021-12-06 19:13:15,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:13:15,512 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2021-12-06 19:13:15,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 19:13:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2021-12-06 19:13:15,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-06 19:13:15,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:13:15,512 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:13:15,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-06 19:13:15,513 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:13:15,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:13:15,513 INFO L85 PathProgramCache]: Analyzing trace with hash 475165103, now seen corresponding path program 1 times [2021-12-06 19:13:15,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:13:15,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747575478] [2021-12-06 19:13:15,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:13:15,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:13:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:15,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:13:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:15,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:13:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 19:13:15,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:13:15,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747575478] [2021-12-06 19:13:15,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747575478] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:13:15,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059224514] [2021-12-06 19:13:15,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:13:15,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:13:15,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:13:15,923 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:13:15,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-06 19:13:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:16,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 96 conjunts are in the unsatisfiable core [2021-12-06 19:13:16,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:13:16,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:13:16,186 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 5 treesize of output 3 [2021-12-06 19:13:16,247 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:13:16,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:13:16,313 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-12-06 19:13:16,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 19:13:16,434 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:13:16,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-06 19:13:16,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:16,450 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 31 treesize of output 26 [2021-12-06 19:13:16,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:16,516 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 31 treesize of output 26 [2021-12-06 19:13:16,632 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:13:16,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-06 19:13:16,807 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 13 [2021-12-06 19:13:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 19:13:16,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:13:16,918 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5752 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5752) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-06 19:13:16,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5752 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_5752) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-06 19:13:16,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5752 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (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|) v_ArrVal_5752) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-06 19:13:16,935 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5752 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5752) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-06 19:13:16,943 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5752 (Array Int Int)) (v_ArrVal_5750 Int)) (<= (+ (select (select (let ((.cse0 (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_ArrVal_5750)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5752)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-06 19:13:16,957 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_ArrVal_5752 (Array Int Int)) (v_ArrVal_5750 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= (+ (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| 8) v_ArrVal_5750))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5752)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 19:13:16,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_ArrVal_5752 (Array Int Int)) (v_ArrVal_5750 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= (+ (select (select (let ((.cse0 (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_44| 8) v_ArrVal_5750))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_5752)) |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-12-06 19:13:16,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_ArrVal_5752 (Array Int Int)) (v_ArrVal_5750 Int)) (or (<= (+ (select (select (let ((.cse0 (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_44| 8) v_ArrVal_5750))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5752)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-06 19:13:16,989 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5748 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_ArrVal_5752 (Array Int Int)) (v_ArrVal_5750 Int)) (or (<= (+ (select (select (let ((.cse0 (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) v_ArrVal_5748) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| 8) v_ArrVal_5750))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5752)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-06 19:13:16,999 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5748 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_ArrVal_5752 (Array Int Int)) (v_ArrVal_5747 (Array Int Int)) (v_ArrVal_5750 Int)) (or (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5747))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) v_ArrVal_5748) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| 8) v_ArrVal_5750))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5752))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-06 19:13:17,016 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5748 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_ArrVal_5752 (Array Int Int)) (v_ArrVal_5747 (Array Int Int)) (v_ArrVal_5750 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5747))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_5748) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| 8) v_ArrVal_5750))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5752))) |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-12-06 19:13:17,034 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5748 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_ArrVal_5752 (Array Int Int)) (v_ArrVal_5747 (Array Int Int)) (v_ArrVal_5746 (Array Int Int)) (v_ArrVal_5750 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= (+ 1 (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5746) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5747))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_5748) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| 8) v_ArrVal_5750))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5752))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |c_#StackHeapBarrier|))) is different from false [2021-12-06 19:13:17,050 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:13:17,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 68 [2021-12-06 19:13:17,053 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 554 treesize of output 540 [2021-12-06 19:13:17,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:17,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:17,058 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 474 treesize of output 462 [2021-12-06 19:13:17,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:17,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:17,063 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 342 treesize of output 318 [2021-12-06 19:13:17,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:17,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:17,069 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 142 treesize of output 128 [2021-12-06 19:13:17,075 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 246 treesize of output 230 [2021-12-06 19:13:17,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059224514] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:13:17,252 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:13:17,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 42 [2021-12-06 19:13:17,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741931705] [2021-12-06 19:13:17,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 19:13:17,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-06 19:13:17,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:13:17,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-06 19:13:17,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2022, Unknown=12, NotChecked=1212, Total=3422 [2021-12-06 19:13:17,253 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand has 43 states, 42 states have (on average 2.5714285714285716) internal successors, (108), 38 states have internal predecessors, (108), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:13:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:13:18,003 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2021-12-06 19:13:18,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 19:13:18,004 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.5714285714285716) internal successors, (108), 38 states have internal predecessors, (108), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 74 [2021-12-06 19:13:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:13:18,004 INFO L225 Difference]: With dead ends: 90 [2021-12-06 19:13:18,004 INFO L226 Difference]: Without dead ends: 90 [2021-12-06 19:13:18,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=351, Invalid=3467, Unknown=12, NotChecked=1572, Total=5402 [2021-12-06 19:13:18,005 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 216 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:13:18,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 586 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:13:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-06 19:13:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2021-12-06 19:13:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:13:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2021-12-06 19:13:18,007 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 74 [2021-12-06 19:13:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:13:18,009 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2021-12-06 19:13:18,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.5714285714285716) internal successors, (108), 38 states have internal predecessors, (108), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:13:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2021-12-06 19:13:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-06 19:13:18,010 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:13:18,010 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:13:18,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2021-12-06 19:13:18,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-12-06 19:13:18,211 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:13:18,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:13:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1801287729, now seen corresponding path program 1 times [2021-12-06 19:13:18,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:13:18,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703127871] [2021-12-06 19:13:18,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:13:18,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:13:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:18,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:13:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:18,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:13:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 19:13:18,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:13:18,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703127871] [2021-12-06 19:13:18,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703127871] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:13:18,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451631816] [2021-12-06 19:13:18,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:13:18,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:13:18,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:13:18,537 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:13:18,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-06 19:13:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:18,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 90 conjunts are in the unsatisfiable core [2021-12-06 19:13:18,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:13:18,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:13:18,804 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:13:18,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:13:18,852 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-12-06 19:13:18,888 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:13:18,888 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 26 treesize of output 27 [2021-12-06 19:13:18,944 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:13:18,944 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 22 treesize of output 22 [2021-12-06 19:13:18,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:18,953 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 26 treesize of output 21 [2021-12-06 19:13:19,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:19,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:19,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:19,081 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:13:19,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-12-06 19:13:19,282 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:13:19,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 32 treesize of output 31 [2021-12-06 19:13:19,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:19,998 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:13:19,998 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 29 treesize of output 29 [2021-12-06 19:13:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 19:13:20,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:13:20,406 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5956) |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-12-06 19:13:20,425 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5956 (Array Int 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_#t~mem12#1.base| v_ArrVal_5956) |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-12-06 19:13:20,434 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5956 (Array Int 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| (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|) v_ArrVal_5956) |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-12-06 19:13:20,450 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5956) |c_ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-06 19:13:20,474 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5954 Int) (v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse0 (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_ArrVal_5954)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5956)) |c_ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) is different from false [2021-12-06 19:13:20,491 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5954 Int) (v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5954))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5956)) |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-12-06 19:13:20,501 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5954 Int) (v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 8) v_ArrVal_5954))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_5956)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))))) is different from false [2021-12-06 19:13:20,511 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5954 Int) (v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0) (not (= (select (select (let ((.cse0 (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| 8) v_ArrVal_5954))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5956)) |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|)))) is different from false [2021-12-06 19:13:20,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5954 Int) (v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0) (not (= (select (select (let ((.cse0 (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|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 8) v_ArrVal_5954))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5956)) |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|)))) is different from false [2021-12-06 19:13:20,531 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5954 Int) (v_ArrVal_5951 (Array Int Int)) (v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5951))) (let ((.cse1 (store (store (select .cse0 |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|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 8) v_ArrVal_5954))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5956))) |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|)) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) is different from false [2021-12-06 19:13:20,550 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5954 Int) (v_ArrVal_5951 (Array Int Int)) (v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5951))) (let ((.cse1 (store (store (select .cse0 |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|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_5954))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5956))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) is different from false [2021-12-06 19:13:20,562 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5950 (Array Int Int)) (v_ArrVal_5954 Int) (v_ArrVal_5951 (Array Int Int)) (v_ArrVal_5956 (Array Int 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_~new_head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5950) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5951))) (let ((.cse1 (store (store (select .cse0 |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|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_5954))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5956))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) is different from false [2021-12-06 19:13:20,578 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:13:20,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 67 [2021-12-06 19:13:20,581 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 539 treesize of output 525 [2021-12-06 19:13:20,584 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:20,584 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:20,591 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:13:20,591 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 714 treesize of output 707 [2021-12-06 19:13:20,600 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 698 treesize of output 682 [2021-12-06 19:13:20,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:20,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:20,613 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:13:20,613 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 1074 treesize of output 1051 [2021-12-06 19:13:20,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:20,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 19:13:20,629 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:13:20,629 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 1245 treesize of output 1235 [2021-12-06 19:13:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2021-12-06 19:13:21,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451631816] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:13:21,666 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:13:21,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 28] total 71 [2021-12-06 19:13:21,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534142952] [2021-12-06 19:13:21,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:13:21,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2021-12-06 19:13:21,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:13:21,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-12-06 19:13:21,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=3248, Unknown=13, NotChecked=1500, Total=4970 [2021-12-06 19:13:21,668 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 71 states, 71 states have (on average 2.380281690140845) internal successors, (169), 63 states have internal predecessors, (169), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-06 19:13:22,453 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5954 Int) (v_ArrVal_5951 (Array Int Int)) (v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5951))) (let ((.cse1 (store (store (select .cse0 |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|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_5954))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5956))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= 0 |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_~head~0#1.base|) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |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|))) is different from false [2021-12-06 19:13:23,033 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (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|))) (and (forall ((v_ArrVal_5954 Int) (v_ArrVal_5951 (Array Int Int)) (v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5951))) (let ((.cse1 (store (store (select .cse0 |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|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 8) v_ArrVal_5954))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5956))) |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|)) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-06 19:13:23,590 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (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|))) (and (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (forall ((v_ArrVal_5954 Int) (v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0) (not (= (select (select (let ((.cse1 (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|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 8) v_ArrVal_5954))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5956)) |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|)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-06 19:13:24,150 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) (forall ((v_ArrVal_5954 Int) (v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0) (not (= (select (select (let ((.cse2 (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| 8) v_ArrVal_5954))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2) (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5956)) |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|)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-06 19:13:24,600 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 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (= .cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 4))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (forall ((v_ArrVal_5954 Int) (v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 8) v_ArrVal_5954))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2) (select .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_5956)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))))) (<= 0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0)))) is different from false [2021-12-06 19:13:25,050 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_ArrVal_5954 Int) (v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (not (= (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5954))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5956)) |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))) (= .cse0 (select .cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 19:13:25,485 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_5954 Int) (v_ArrVal_5956 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse0 (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_ArrVal_5954)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5956)) |c_ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (< |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) (not (= .cse1 |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (= .cse1 (select .cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 19:13:25,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:13:25,854 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2021-12-06 19:13:25,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 19:13:25,854 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.380281690140845) internal successors, (169), 63 states have internal predecessors, (169), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 75 [2021-12-06 19:13:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:13:25,855 INFO L225 Difference]: With dead ends: 84 [2021-12-06 19:13:25,855 INFO L226 Difference]: Without dead ends: 84 [2021-12-06 19:13:25,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 85 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=291, Invalid=4321, Unknown=20, NotChecked=2850, Total=7482 [2021-12-06 19:13:25,857 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 39 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 608 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:13:25,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 1459 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 656 Invalid, 0 Unknown, 608 Unchecked, 0.2s Time] [2021-12-06 19:13:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-06 19:13:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-12-06 19:13:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 79 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:13:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2021-12-06 19:13:25,860 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 75 [2021-12-06 19:13:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:13:25,860 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2021-12-06 19:13:25,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.380281690140845) internal successors, (169), 63 states have internal predecessors, (169), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-06 19:13:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2021-12-06 19:13:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-06 19:13:25,861 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:13:25,861 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:13:25,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2021-12-06 19:13:26,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:13:26,062 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-06 19:13:26,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:13:26,063 INFO L85 PathProgramCache]: Analyzing trace with hash -568453664, now seen corresponding path program 1 times [2021-12-06 19:13:26,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:13:26,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244882416] [2021-12-06 19:13:26,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:13:26,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:13:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:26,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:13:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:26,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:13:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 19:13:26,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:13:26,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244882416] [2021-12-06 19:13:26,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244882416] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:13:26,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155798234] [2021-12-06 19:13:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:13:26,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:13:26,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:13:26,707 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:13:26,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525169f3-232a-4acc-b4d4-089e9abd5557/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-06 19:13:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:13:26,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 128 conjunts are in the unsatisfiable core [2021-12-06 19:13:26,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:13:26,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:13:27,028 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:13:27,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:13:27,053 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-12-06 19:13:27,055 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-12-06 19:13:27,102 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 19:13:27,102 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 36 treesize of output 35 [2021-12-06 19:13:27,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-06 19:13:27,188 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-06 19:13:27,189 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 47 treesize of output 33 [2021-12-06 19:13:27,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-12-06 19:13:27,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:27,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-06 19:13:27,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:27,235 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 19:13:27,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2021-12-06 19:13:27,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:27,383 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 19:13:27,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2021-12-06 19:13:27,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:27,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-06 19:13:27,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:13:27,579 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 19:13:27,579 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 2 case distinctions, treesize of input 73 treesize of output 57 [2021-12-06 19:13:27,587 INFO L354 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2021-12-06 19:13:27,587 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2021-12-06 19:13:27,930 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-12-06 19:13:27,930 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 5 case distinctions, treesize of input 53 treesize of output 39 [2021-12-06 19:13:27,934 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:13:27,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-12-06 19:13:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 19:13:28,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:14:04,666 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (and (forall ((v_ArrVal_6173 Int) (v_ArrVal_6172 Int)) (= (select (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| 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|) .cse0 v_ArrVal_6173)) (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|) .cse0 v_ArrVal_6172)) |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_ArrVal_6172 Int)) (= (select (let ((.cse1 (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_48| 8) v_ArrVal_6172)))) (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|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0))) is different from false [2021-12-06 19:14:06,752 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| (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|)) (and (forall ((v_ArrVal_6172 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_48| 8) v_ArrVal_6172))))) (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_ArrVal_6173 Int) (v_ArrVal_6172 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_48| 8))) (select (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 v_ArrVal_6173)) (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 v_ArrVal_6172)) |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-12-06 19:14:08,934 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| (select (select |c_#memory_$Pointer$.offset| |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) (and (forall ((v_ArrVal_6173 Int) (v_ArrVal_6172 Int)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (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|)) (.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| 8))) (select (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_6173)) (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 v_ArrVal_6172)) |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_ArrVal_6172 Int)) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse2 (let ((.cse3 (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| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| 8) v_ArrVal_6172))))) (select .cse2 (select (select .cse2 |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-12-06 19:14:11,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| Int) (v_ArrVal_6168 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| (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_ArrVal_6168)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0) (and (forall ((v_ArrVal_6173 Int) (v_ArrVal_6172 Int) (v_ArrVal_6170 Int)) (= (select (let ((.cse3 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (let ((.cse4 (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|) .cse3 v_ArrVal_6170)))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| 8))) (select (let ((.cse0 (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|) .cse3 v_ArrVal_6168)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_6173))) (select (select (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_6172)) |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_ArrVal_6172 Int) (v_ArrVal_6170 Int)) (= (select (let ((.cse5 (let ((.cse6 (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_ArrVal_6170)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store .cse6 .cse7 (store (select .cse6 .cse7) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| 8) v_ArrVal_6172)))))) (select .cse5 (select (select .cse5 |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|))))) is different from false [2021-12-06 19:14:13,725 WARN L838 $PredicateComparison]: unable to prove that (forall ((|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_ArrVal_6168 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| (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_50| 8) v_ArrVal_6168) |c_ULTIMATE.start_main_~s~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_main_~s~0#1.offset|) (< |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0) (and (forall ((v_ArrVal_6172 Int) (v_ArrVal_6170 Int)) (= (select (let ((.cse0 (let ((.cse3 (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_ArrVal_6170))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3)) (.cse2 (select .cse3 |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_48| 8) v_ArrVal_6172)))))) (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_ArrVal_6173 Int) (v_ArrVal_6172 Int) (v_ArrVal_6170 Int)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse7 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8))) (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse7 v_ArrVal_6170))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse6 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| 8))) (select (let ((.cse4 (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|) .cse7 v_ArrVal_6168)))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_6173))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse9))) (store .cse8 .cse5 (store (select .cse8 .cse5) .cse6 v_ArrVal_6172))) |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-12-06 19:14:15,968 WARN L838 $PredicateComparison]: unable to prove that (forall ((|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_ArrVal_6168 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (and (forall ((v_ArrVal_6173 Int) (v_ArrVal_6172 Int) (v_ArrVal_6170 Int)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| (select (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8))) (let ((.cse5 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse3 v_ArrVal_6170))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_48| 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_ArrVal_6168)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_6173))) (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_ArrVal_6172))) |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_ArrVal_6172 Int) (v_ArrVal_6170 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_50| 8) v_ArrVal_6170))) (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_48| 8) v_ArrVal_6172)))))) (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_48| (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_50| 8) v_ArrVal_6168) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (< |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0))) is different from false [2021-12-06 19:18:02,361 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:18:02,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1063 treesize of output 991 [2021-12-06 19:18:02,854 INFO L354 Elim1Store]: treesize reduction 312, result has 66.7 percent of original size [2021-12-06 19:18:02,856 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 27704360 treesize of output 26805478 [2021-12-06 19:18:06,401 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:18:06,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26805478 treesize of output 17075278 [2021-12-06 19:18:16,593 INFO L354 Elim1Store]: treesize reduction 3047, result has 20.7 percent of original size [2021-12-06 19:18:16,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 32 new quantified variables, introduced 210 case distinctions, treesize of input 6796356999 treesize of output 6163562905