./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:13:56,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:13:56,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:13:56,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:13:56,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:13:56,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:13:56,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:13:56,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:13:56,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:13:56,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:13:56,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:13:56,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:13:56,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:13:56,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:13:56,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:13:56,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:13:56,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:13:56,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:13:56,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:13:56,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:13:56,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:13:56,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:13:56,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:13:56,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:13:56,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:13:56,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:13:56,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:13:56,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:13:56,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:13:56,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:13:56,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:13:56,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:13:56,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:13:56,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:13:56,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:13:56,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:13:56,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:13:56,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:13:56,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:13:56,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:13:56,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:13:56,427 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 12:13:56,441 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:13:56,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:13:56,441 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:13:56,442 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:13:56,442 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:13:56,442 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:13:56,443 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:13:56,443 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:13:56,443 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:13:56,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:13:56,443 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:13:56,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:13:56,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:13:56,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:13:56,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:13:56,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:13:56,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:13:56,444 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:13:56,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:13:56,445 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:13:56,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:13:56,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:13:56,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:13:56,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:13:56,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:13:56,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:13:56,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:13:56,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:13:56,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:13:56,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:13:56,446 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:13:56,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 12:13:56,446 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:13:56,446 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:13:56,446 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:13:56,447 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/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_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8 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 ! call(reach_error())) ) 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 -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2022-12-13 12:13:56,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:13:56,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:13:56,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:13:56,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:13:56,667 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:13:56,668 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-12-13 12:13:59,335 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:13:59,499 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:13:59,500 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-12-13 12:13:59,507 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/data/fbe5100bc/a2fe00aa6f324bebbcb735f4f0a3709d/FLAG8b8a13a90 [2022-12-13 12:13:59,518 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/data/fbe5100bc/a2fe00aa6f324bebbcb735f4f0a3709d [2022-12-13 12:13:59,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:13:59,521 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:13:59,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:13:59,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:13:59,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:13:59,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:13:59" (1/1) ... [2022-12-13 12:13:59,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c7f41dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:13:59, skipping insertion in model container [2022-12-13 12:13:59,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:13:59" (1/1) ... [2022-12-13 12:13:59,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:13:59,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:13:59,768 WARN L237 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_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-12-13 12:13:59,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:13:59,780 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:13:59,819 WARN L237 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_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-12-13 12:13:59,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:13:59,842 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:13:59,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:13:59 WrapperNode [2022-12-13 12:13:59,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:13:59,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:13:59,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:13:59,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:13:59,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:13:59" (1/1) ... [2022-12-13 12:13:59,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:13:59" (1/1) ... [2022-12-13 12:13:59,879 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-12-13 12:13:59,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:13:59,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:13:59,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:13:59,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:13:59,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:13:59" (1/1) ... [2022-12-13 12:13:59,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:13:59" (1/1) ... [2022-12-13 12:13:59,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:13:59" (1/1) ... [2022-12-13 12:13:59,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:13:59" (1/1) ... [2022-12-13 12:13:59,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:13:59" (1/1) ... [2022-12-13 12:13:59,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:13:59" (1/1) ... [2022-12-13 12:13:59,904 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:13:59" (1/1) ... [2022-12-13 12:13:59,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:13:59" (1/1) ... [2022-12-13 12:13:59,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:13:59,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:13:59,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:13:59,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:13:59,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:13:59" (1/1) ... [2022-12-13 12:13:59,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:13:59,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:13:59,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:13:59,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:13:59,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:13:59,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:13:59,958 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-13 12:13:59,958 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-13 12:13:59,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 12:13:59,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:13:59,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 12:13:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 12:13:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:13:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:13:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:13:59,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:14:00,042 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:14:00,044 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:14:00,191 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:14:00,198 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:14:00,198 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 12:14:00,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:14:00 BoogieIcfgContainer [2022-12-13 12:14:00,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:14:00,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:14:00,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:14:00,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:14:00,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:13:59" (1/3) ... [2022-12-13 12:14:00,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c98ce9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:14:00, skipping insertion in model container [2022-12-13 12:14:00,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:13:59" (2/3) ... [2022-12-13 12:14:00,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c98ce9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:14:00, skipping insertion in model container [2022-12-13 12:14:00,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:14:00" (3/3) ... [2022-12-13 12:14:00,209 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-12-13 12:14:00,226 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:14:00,226 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:14:00,270 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:14:00,276 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@623d0bb2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:14:00,276 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 12:14:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 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) [2022-12-13 12:14:00,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 12:14:00,285 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:14:00,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:14:00,286 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:14:00,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:14:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1387430191, now seen corresponding path program 1 times [2022-12-13 12:14:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:14:00,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036058412] [2022-12-13 12:14:00,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:00,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:14:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:00,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:14:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:14:00,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:14:00,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036058412] [2022-12-13 12:14:00,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036058412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:14:00,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:14:00,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:14:00,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673791848] [2022-12-13 12:14:00,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:14:00,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:14:00,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:14:00,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:14:00,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:14:00,555 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 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, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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) [2022-12-13 12:14:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:14:00,605 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-12-13 12:14:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:14:00,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 20 [2022-12-13 12:14:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:14:00,613 INFO L225 Difference]: With dead ends: 63 [2022-12-13 12:14:00,613 INFO L226 Difference]: Without dead ends: 30 [2022-12-13 12:14:00,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:14:00,617 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:14:00,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:14:00,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-12-13 12:14:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-12-13 12:14:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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) [2022-12-13 12:14:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-12-13 12:14:00,644 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2022-12-13 12:14:00,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:14:00,645 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-12-13 12:14:00,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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) [2022-12-13 12:14:00,645 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-12-13 12:14:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 12:14:00,646 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:14:00,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:14:00,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:14:00,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:14:00,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:14:00,647 INFO L85 PathProgramCache]: Analyzing trace with hash 498100996, now seen corresponding path program 1 times [2022-12-13 12:14:00,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:14:00,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168173591] [2022-12-13 12:14:00,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:00,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:14:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:00,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:14:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:14:00,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:14:00,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168173591] [2022-12-13 12:14:00,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168173591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:14:00,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:14:00,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:14:00,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116231119] [2022-12-13 12:14:00,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:14:00,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:14:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:14:00,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:14:00,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:14:00,822 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2022-12-13 12:14:00,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:14:00,858 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-12-13 12:14:00,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:14:00,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2022-12-13 12:14:00,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:14:00,860 INFO L225 Difference]: With dead ends: 51 [2022-12-13 12:14:00,860 INFO L226 Difference]: Without dead ends: 35 [2022-12-13 12:14:00,860 INFO L412 NwaCegarLoop]: 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 [2022-12-13 12:14:00,862 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:14:00,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:14:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-12-13 12:14:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-12-13 12:14:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2022-12-13 12:14:00,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-12-13 12:14:00,869 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-12-13 12:14:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:14:00,870 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-12-13 12:14:00,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2022-12-13 12:14:00,870 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-12-13 12:14:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 12:14:00,871 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:14:00,871 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:14:00,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:14:00,871 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:14:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:14:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash 698671896, now seen corresponding path program 1 times [2022-12-13 12:14:00,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:14:00,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433978705] [2022-12-13 12:14:00,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:00,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:14:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:01,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:14:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:01,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:14:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 12:14:01,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:14:01,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433978705] [2022-12-13 12:14:01,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433978705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:14:01,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:14:01,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:14:01,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322233256] [2022-12-13 12:14:01,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:14:01,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:14:01,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:14:01,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:14:01,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:14:01,035 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-12-13 12:14:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:14:01,089 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-12-13 12:14:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:14:01,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 30 [2022-12-13 12:14:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:14:01,090 INFO L225 Difference]: With dead ends: 53 [2022-12-13 12:14:01,090 INFO L226 Difference]: Without dead ends: 44 [2022-12-13 12:14:01,091 INFO L412 NwaCegarLoop]: 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 [2022-12-13 12:14:01,091 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 47 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:14:01,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 80 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:14:01,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-13 12:14:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-12-13 12:14:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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) [2022-12-13 12:14:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-12-13 12:14:01,096 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 30 [2022-12-13 12:14:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:14:01,097 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-12-13 12:14:01,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-12-13 12:14:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-12-13 12:14:01,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 12:14:01,098 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:14:01,098 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:14:01,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:14:01,098 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:14:01,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:14:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash 143562896, now seen corresponding path program 1 times [2022-12-13 12:14:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:14:01,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304849979] [2022-12-13 12:14:01,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:14:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:01,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:14:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:01,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:14:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 12:14:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:14:01,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304849979] [2022-12-13 12:14:01,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304849979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:14:01,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:14:01,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:14:01,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141251844] [2022-12-13 12:14:01,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:14:01,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:14:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:14:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:14:01,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:14:01,245 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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) [2022-12-13 12:14:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:14:01,307 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-12-13 12:14:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:14:01,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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 35 [2022-12-13 12:14:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:14:01,308 INFO L225 Difference]: With dead ends: 59 [2022-12-13 12:14:01,308 INFO L226 Difference]: Without dead ends: 45 [2022-12-13 12:14:01,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:14:01,309 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:14:01,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 88 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:14:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-12-13 12:14:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-12-13 12:14:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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) [2022-12-13 12:14:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-12-13 12:14:01,314 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 35 [2022-12-13 12:14:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:14:01,314 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-12-13 12:14:01,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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) [2022-12-13 12:14:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-12-13 12:14:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 12:14:01,316 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:14:01,316 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 12:14:01,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:14:01,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:14:01,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:14:01,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1641789207, now seen corresponding path program 1 times [2022-12-13 12:14:01,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:14:01,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834632516] [2022-12-13 12:14:01,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:01,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:14:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:01,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:14:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:01,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:14:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:01,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 12:14:01,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:14:01,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834632516] [2022-12-13 12:14:01,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834632516] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:14:01,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233796566] [2022-12-13 12:14:01,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:01,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:14:01,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:14:01,436 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:14:01,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 12:14:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:01,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 12:14:01,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:14:01,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 12:14:01,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:14:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 12:14:01,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233796566] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:14:01,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:14:01,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-12-13 12:14:01,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414926741] [2022-12-13 12:14:01,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:14:01,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:14:01,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:14:01,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:14:01,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:14:01,679 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 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) [2022-12-13 12:14:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:14:01,748 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-12-13 12:14:01,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:14:01,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 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 36 [2022-12-13 12:14:01,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:14:01,749 INFO L225 Difference]: With dead ends: 56 [2022-12-13 12:14:01,749 INFO L226 Difference]: Without dead ends: 47 [2022-12-13 12:14:01,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:14:01,750 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 93 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:14:01,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 123 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:14:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-13 12:14:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2022-12-13 12:14:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 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) [2022-12-13 12:14:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-12-13 12:14:01,758 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 36 [2022-12-13 12:14:01,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:14:01,758 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-12-13 12:14:01,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 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) [2022-12-13 12:14:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-12-13 12:14:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 12:14:01,759 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:14:01,759 INFO L195 NwaCegarLoop]: 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] [2022-12-13 12:14:01,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:14:01,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:14:01,962 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:14:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:14:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1233857887, now seen corresponding path program 2 times [2022-12-13 12:14:01,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:14:01,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738623200] [2022-12-13 12:14:01,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:01,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:14:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:02,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:14:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:02,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:14:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 12:14:02,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:14:02,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738623200] [2022-12-13 12:14:02,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738623200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:14:02,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:14:02,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:14:02,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807986897] [2022-12-13 12:14:02,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:14:02,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:14:02,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:14:02,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:14:02,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:14:02,215 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-12-13 12:14:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:14:02,268 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-12-13 12:14:02,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:14:02,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 41 [2022-12-13 12:14:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:14:02,269 INFO L225 Difference]: With dead ends: 55 [2022-12-13 12:14:02,269 INFO L226 Difference]: Without dead ends: 47 [2022-12-13 12:14:02,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:14:02,270 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 25 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:14:02,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 104 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:14:02,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-13 12:14:02,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-12-13 12:14:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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) [2022-12-13 12:14:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-12-13 12:14:02,285 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 41 [2022-12-13 12:14:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:14:02,286 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-12-13 12:14:02,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-12-13 12:14:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-12-13 12:14:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 12:14:02,287 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:14:02,287 INFO L195 NwaCegarLoop]: 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] [2022-12-13 12:14:02,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:14:02,287 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:14:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:14:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash -353457273, now seen corresponding path program 1 times [2022-12-13 12:14:02,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:14:02,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870133735] [2022-12-13 12:14:02,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:02,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:14:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:03,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:14:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:03,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:14:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:14:04,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:14:04,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870133735] [2022-12-13 12:14:04,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870133735] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:14:04,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055032059] [2022-12-13 12:14:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:04,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:14:04,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:14:04,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:14:04,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 12:14:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:04,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 109 conjunts are in the unsatisfiable core [2022-12-13 12:14:04,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:14:04,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:14:04,371 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:14:04,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 12:14:04,421 INFO L350 Elim1Store]: Elim1 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 [2022-12-13 12:14:04,479 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:14:04,479 INFO L350 Elim1Store]: Elim1 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 [2022-12-13 12:14:04,602 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-12-13 12:14:04,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 100 [2022-12-13 12:14:04,608 INFO L350 Elim1Store]: Elim1 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 13 [2022-12-13 12:14:04,613 INFO L350 Elim1Store]: Elim1 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 77 treesize of output 65 [2022-12-13 12:14:04,620 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 11 [2022-12-13 12:14:04,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-12-13 12:14:04,640 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 7 [2022-12-13 12:14:04,873 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:14:04,874 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 55 [2022-12-13 12:14:04,881 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 21 [2022-12-13 12:14:04,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:14:04,885 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 34 [2022-12-13 12:14:05,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:14:05,058 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-12-13 12:14:05,064 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 30 [2022-12-13 12:14:05,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:14:05,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-12-13 12:14:05,257 INFO L350 Elim1Store]: Elim1 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 [2022-12-13 12:14:05,261 INFO L350 Elim1Store]: Elim1 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 [2022-12-13 12:14:05,298 INFO L350 Elim1Store]: Elim1 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 [2022-12-13 12:14:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:14:05,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:14:05,851 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_745 (Array Int Int)) (v_ArrVal_748 Int) (v_ArrVal_747 Int)) (<= .cse0 (+ (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_745) (select (store .cse1 .cse2 v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (store .cse3 .cse2 v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_745 (Array Int Int)) (v_ArrVal_748 Int) (v_ArrVal_747 Int)) (<= (+ (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_745) (select (store .cse1 .cse4 v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (store .cse3 .cse4 v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) .cse0)))))) is different from false [2022-12-13 12:14:05,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:14:05,916 INFO L350 Elim1Store]: Elim1 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 50 treesize of output 51 [2022-12-13 12:14:05,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:14:05,927 INFO L350 Elim1Store]: Elim1 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 104 treesize of output 103 [2022-12-13 12:14:05,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-12-13 12:14:05,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:14:05,992 INFO L350 Elim1Store]: Elim1 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 50 treesize of output 51 [2022-12-13 12:14:06,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:14:06,004 INFO L350 Elim1Store]: Elim1 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 104 treesize of output 103 [2022-12-13 12:14:06,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-12-13 12:14:06,071 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_748 Int) (v_ArrVal_741 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_741) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-12-13 12:14:06,137 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.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|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_748 Int) (v_ArrVal_741 (Array Int Int))) (= (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|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_741) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse2 .cse1) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-12-13 12:14:06,174 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_748 Int) (v_ArrVal_741 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_741) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-12-13 12:14:06,202 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_742) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_748 Int) (v_ArrVal_741 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_741) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_748) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_742) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse0)))))) is different from false [2022-12-13 12:14:06,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:14:06,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-13 12:14:06,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:14:06,223 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 26 [2022-12-13 12:14:06,241 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_738 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (store (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_738)) .cse2 v_ArrVal_742) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse2)))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_738 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse3 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_ArrVal_738)) (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_742)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_737 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2022-12-13 12:14:06,281 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_738 Int)) (or (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (store (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_738)) .cse2 v_ArrVal_742) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse2)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_738 Int)) (or (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (not (= (select (store (select (let ((.cse3 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 .cse1 v_ArrVal_738)) (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_742)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_ArrVal_737 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |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 [2022-12-13 12:14:06,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:14:06,529 INFO L350 Elim1Store]: Elim1 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 [2022-12-13 12:14:06,532 INFO L350 Elim1Store]: Elim1 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 131 treesize of output 119 [2022-12-13 12:14:06,536 INFO L350 Elim1Store]: Elim1 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 [2022-12-13 12:14:06,539 INFO L350 Elim1Store]: Elim1 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 [2022-12-13 12:14:06,543 INFO L350 Elim1Store]: Elim1 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 [2022-12-13 12:14:06,551 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 12:14:06,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 1 [2022-12-13 12:14:06,557 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 12:14:06,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 1 [2022-12-13 12:14:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-12-13 12:14:06,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055032059] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:14:06,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:14:06,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 25] total 68 [2022-12-13 12:14:06,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727406556] [2022-12-13 12:14:06,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:14:06,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-12-13 12:14:06,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:14:06,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-12-13 12:14:06,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=3431, Unknown=34, NotChecked=868, Total=4556 [2022-12-13 12:14:06,885 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 68 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 59 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 12:14:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:14:10,133 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2022-12-13 12:14:10,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 12:14:10,134 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 59 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-12-13 12:14:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:14:10,137 INFO L225 Difference]: With dead ends: 104 [2022-12-13 12:14:10,137 INFO L226 Difference]: Without dead ends: 102 [2022-12-13 12:14:10,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 83 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=467, Invalid=5532, Unknown=35, NotChecked=1106, Total=7140 [2022-12-13 12:14:10,141 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 247 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 449 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:14:10,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 819 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1333 Invalid, 2 Unknown, 449 Unchecked, 1.1s Time] [2022-12-13 12:14:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-13 12:14:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 66. [2022-12-13 12:14:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 61 states have internal predecessors, (74), 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) [2022-12-13 12:14:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-12-13 12:14:10,150 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 42 [2022-12-13 12:14:10,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:14:10,150 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2022-12-13 12:14:10,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 59 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 12:14:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2022-12-13 12:14:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 12:14:10,151 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:14:10,151 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:14:10,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 12:14:10,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:14:10,353 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:14:10,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:14:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1979380319, now seen corresponding path program 2 times [2022-12-13 12:14:10,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:14:10,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159711780] [2022-12-13 12:14:10,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:10,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:14:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:10,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:14:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:10,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:14:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 12:14:10,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:14:10,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159711780] [2022-12-13 12:14:10,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159711780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:14:10,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:14:10,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:14:10,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707842827] [2022-12-13 12:14:10,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:14:10,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:14:10,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:14:10,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:14:10,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:14:10,498 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 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) [2022-12-13 12:14:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:14:10,555 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-12-13 12:14:10,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:14:10,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 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 43 [2022-12-13 12:14:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:14:10,556 INFO L225 Difference]: With dead ends: 75 [2022-12-13 12:14:10,556 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 12:14:10,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:14:10,557 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:14:10,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 77 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:14:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 12:14:10,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-12-13 12:14:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 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) [2022-12-13 12:14:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-12-13 12:14:10,570 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 43 [2022-12-13 12:14:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:14:10,570 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-12-13 12:14:10,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 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) [2022-12-13 12:14:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-12-13 12:14:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 12:14:10,571 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:14:10,572 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:14:10,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:14:10,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:14:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:14:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 497262156, now seen corresponding path program 3 times [2022-12-13 12:14:10,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:14:10,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921053716] [2022-12-13 12:14:10,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:10,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:14:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:10,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:14:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:10,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:14:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 12:14:10,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:14:10,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921053716] [2022-12-13 12:14:10,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921053716] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:14:10,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086218669] [2022-12-13 12:14:10,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 12:14:10,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:14:10,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:14:10,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:14:10,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 12:14:11,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 12:14:11,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:14:11,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 12:14:11,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:14:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 12:14:11,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:14:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 12:14:11,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086218669] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 12:14:11,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:14:11,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 11 [2022-12-13 12:14:11,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592357759] [2022-12-13 12:14:11,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:14:11,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:14:11,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:14:11,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:14:11,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:14:11,677 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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) [2022-12-13 12:14:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:14:11,712 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-12-13 12:14:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:14:11,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 43 [2022-12-13 12:14:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:14:11,713 INFO L225 Difference]: With dead ends: 84 [2022-12-13 12:14:11,713 INFO L226 Difference]: Without dead ends: 72 [2022-12-13 12:14:11,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-13 12:14:11,714 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:14:11,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 101 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:14:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-13 12:14:11,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2022-12-13 12:14:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 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) [2022-12-13 12:14:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-12-13 12:14:11,726 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 43 [2022-12-13 12:14:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:14:11,726 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-12-13 12:14:11,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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) [2022-12-13 12:14:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-12-13 12:14:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 12:14:11,727 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:14:11,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:14:11,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 12:14:11,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:14:11,929 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:14:11,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:14:11,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1076128498, now seen corresponding path program 4 times [2022-12-13 12:14:11,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:14:11,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921199254] [2022-12-13 12:14:11,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:11,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:14:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:12,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:14:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:14:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 12:14:12,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:14:12,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921199254] [2022-12-13 12:14:12,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921199254] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:14:12,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060142431] [2022-12-13 12:14:12,069 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 12:14:12,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:14:12,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:14:12,070 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:14:12,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 12:14:12,193 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 12:14:12,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:14:12,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 12:14:12,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:14:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 12:14:12,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:14:12,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060142431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:14:12,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:14:12,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-12-13 12:14:12,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259830972] [2022-12-13 12:14:12,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:14:12,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:14:12,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:14:12,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:14:12,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:14:12,232 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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) [2022-12-13 12:14:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:14:12,266 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-12-13 12:14:12,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:14:12,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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 43 [2022-12-13 12:14:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:14:12,267 INFO L225 Difference]: With dead ends: 89 [2022-12-13 12:14:12,267 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 12:14:12,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-13 12:14:12,267 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 66 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:14:12,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 69 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:14:12,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 12:14:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-12-13 12:14:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 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) [2022-12-13 12:14:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-12-13 12:14:12,276 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 43 [2022-12-13 12:14:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:14:12,276 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-12-13 12:14:12,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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) [2022-12-13 12:14:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-12-13 12:14:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 12:14:12,277 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:14:12,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:14:12,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 12:14:12,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:14:12,479 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:14:12,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:14:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash 315770834, now seen corresponding path program 1 times [2022-12-13 12:14:12,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:14:12,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001110217] [2022-12-13 12:14:12,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:12,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:14:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:13,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:14:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:13,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:14:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:14:13,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:14:13,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001110217] [2022-12-13 12:14:13,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001110217] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:14:13,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17922748] [2022-12-13 12:14:13,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:13,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:14:13,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:14:13,209 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:14:13,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 12:14:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:13,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 12:14:13,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:14:13,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 12:14:13,606 INFO L350 Elim1Store]: Elim1 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 [2022-12-13 12:14:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 12:14:13,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:14:13,790 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 32 [2022-12-13 12:14:13,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:14:13,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:14:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 12:14:13,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17922748] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:14:13,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:14:13,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 11] total 36 [2022-12-13 12:14:13,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154813623] [2022-12-13 12:14:13,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:14:13,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 12:14:13,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:14:13,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 12:14:13,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2022-12-13 12:14:13,885 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 36 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 12:14:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:14:14,787 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2022-12-13 12:14:14,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 12:14:14,788 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2022-12-13 12:14:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:14:14,789 INFO L225 Difference]: With dead ends: 94 [2022-12-13 12:14:14,789 INFO L226 Difference]: Without dead ends: 92 [2022-12-13 12:14:14,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=407, Invalid=2245, Unknown=0, NotChecked=0, Total=2652 [2022-12-13 12:14:14,791 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 284 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:14:14,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 426 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 12:14:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-13 12:14:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2022-12-13 12:14:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 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) [2022-12-13 12:14:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-12-13 12:14:14,801 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 48 [2022-12-13 12:14:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:14:14,802 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-12-13 12:14:14,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 12:14:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-12-13 12:14:14,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 12:14:14,802 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:14:14,802 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:14:14,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 12:14:15,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:14:15,004 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:14:15,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:14:15,005 INFO L85 PathProgramCache]: Analyzing trace with hash 58122200, now seen corresponding path program 5 times [2022-12-13 12:14:15,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:14:15,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360585432] [2022-12-13 12:14:15,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:15,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:14:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:15,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:14:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:15,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:14:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 12:14:15,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:14:15,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360585432] [2022-12-13 12:14:15,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360585432] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:14:15,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58931804] [2022-12-13 12:14:15,137 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 12:14:15,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:14:15,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:14:15,138 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:14:15,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 12:14:15,267 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 12:14:15,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:14:15,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 12:14:15,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:14:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 12:14:15,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:14:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 12:14:15,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58931804] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:14:15,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:14:15,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 12:14:15,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963128485] [2022-12-13 12:14:15,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:14:15,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 12:14:15,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:14:15,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 12:14:15,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:14:15,357 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 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) [2022-12-13 12:14:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:14:15,509 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2022-12-13 12:14:15,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:14:15,510 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 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 48 [2022-12-13 12:14:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:14:15,510 INFO L225 Difference]: With dead ends: 112 [2022-12-13 12:14:15,510 INFO L226 Difference]: Without dead ends: 73 [2022-12-13 12:14:15,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-12-13 12:14:15,512 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 120 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:14:15,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 196 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:14:15,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-12-13 12:14:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-12-13 12:14:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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) [2022-12-13 12:14:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-12-13 12:14:15,523 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 48 [2022-12-13 12:14:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:14:15,523 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-12-13 12:14:15,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 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) [2022-12-13 12:14:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-12-13 12:14:15,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 12:14:15,523 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:14:15,523 INFO L195 NwaCegarLoop]: 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] [2022-12-13 12:14:15,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 12:14:15,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:14:15,725 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:14:15,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:14:15,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1250615156, now seen corresponding path program 2 times [2022-12-13 12:14:15,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:14:15,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075932041] [2022-12-13 12:14:15,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:15,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:14:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:15,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:14:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:15,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:14:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 12:14:15,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:14:15,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075932041] [2022-12-13 12:14:15,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075932041] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:14:15,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953922507] [2022-12-13 12:14:15,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:14:15,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:14:15,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:14:15,862 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:14:15,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 12:14:16,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:14:16,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:14:16,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 12:14:16,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:14:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 12:14:16,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:14:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 12:14:16,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953922507] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:14:16,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:14:16,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-12-13 12:14:16,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024716531] [2022-12-13 12:14:16,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:14:16,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:14:16,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:14:16,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:14:16,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:14:16,160 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 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) [2022-12-13 12:14:16,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:14:16,237 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-12-13 12:14:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:14:16,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 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 49 [2022-12-13 12:14:16,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:14:16,238 INFO L225 Difference]: With dead ends: 73 [2022-12-13 12:14:16,238 INFO L226 Difference]: Without dead ends: 43 [2022-12-13 12:14:16,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-12-13 12:14:16,239 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:14:16,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 146 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:14:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-13 12:14:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-12-13 12:14:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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) [2022-12-13 12:14:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-12-13 12:14:16,244 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 49 [2022-12-13 12:14:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:14:16,244 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-12-13 12:14:16,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 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) [2022-12-13 12:14:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-12-13 12:14:16,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 12:14:16,245 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:14:16,245 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-12-13 12:14:16,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 12:14:16,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 12:14:16,447 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:14:16,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:14:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash -744940389, now seen corresponding path program 6 times [2022-12-13 12:14:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:14:16,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917076282] [2022-12-13 12:14:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:14:16,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:14:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:16,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:14:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:16,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:14:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:16,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:14:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:14:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 12:14:16,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:14:16,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917076282] [2022-12-13 12:14:16,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917076282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:14:16,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136048802] [2022-12-13 12:14:16,633 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 12:14:16,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:14:16,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:14:16,634 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:14:16,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 12:14:17,064 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 12:14:17,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:14:17,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 12:14:17,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:14:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 12:14:17,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:14:17,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136048802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:14:17,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:14:17,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-13 12:14:17,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293176206] [2022-12-13 12:14:17,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:14:17,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:14:17,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:14:17,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:14:17,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:14:17,081 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) [2022-12-13 12:14:17,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:14:17,087 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-12-13 12:14:17,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:14:17,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 52 [2022-12-13 12:14:17,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:14:17,087 INFO L225 Difference]: With dead ends: 48 [2022-12-13 12:14:17,088 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 12:14:17,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:14:17,088 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:14:17,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:14:17,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 12:14:17,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 12:14:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:14:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 12:14:17,089 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-12-13 12:14:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:14:17,089 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 12:14:17,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) [2022-12-13 12:14:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 12:14:17,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 12:14:17,091 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 12:14:17,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 12:14:17,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 12:14:17,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 12:14:18,804 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 2) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) [2022-12-13 12:14:18,805 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-12-13 12:14:18,805 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 626 645) the Hoare annotation is: true [2022-12-13 12:14:18,805 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 12:14:18,805 INFO L899 garLoopResultBuilder]: For program point L631-2(lines 631 634) no Hoare annotation was computed. [2022-12-13 12:14:18,805 INFO L895 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse4 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse12 (select (select |#memory_int| .cse11) 8))) (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse2 (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_circular_update_at_~index#1|)) (.cse10 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse3 (<= .cse4 .cse12)) (.cse5 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse8 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8))) (and .cse0 (<= .cse1 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse2 (<= |ULTIMATE.start_main_~len~0#1| .cse1) .cse3 (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8) .cse4) .cse5 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) (* |ULTIMATE.start_main_~len~0#1| 2)) .cse6 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse7 .cse8 .cse9 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))) (and .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|)) .cse10 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|) |ULTIMATE.start_dll_circular_create_#res#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) .cse6 (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (not (= (select (store (select (store |#memory_$Pointer$.base| .cse11 v_ArrVal_742) |ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 .cse8 .cse9 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and .cse0 (not (= .cse11 |ULTIMATE.start_main_~s~0#1.base|)) (<= .cse12 .cse4) .cse2 .cse10 .cse3 (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9))))) [2022-12-13 12:14:18,805 INFO L899 garLoopResultBuilder]: For program point L631-4(lines 631 634) no Hoare annotation was computed. [2022-12-13 12:14:18,805 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2022-12-13 12:14:18,805 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2022-12-13 12:14:18,805 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 12:14:18,805 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-12-13 12:14:18,806 INFO L895 garLoopResultBuilder]: At program point dll_circular_get_data_at_returnLabel#1(lines 612 618) the Hoare annotation is: (and (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0)) (.cse6 (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))) (.cse4 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0)) (.cse5 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse7 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse8 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse2 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 (= 2 |ULTIMATE.start_main_~expected~0#1|) (= 2 |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (= (select .cse2 8) .cse3) (= .cse3 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse4 .cse5 (= .cse6 2) .cse7 .cse8 .cse9) (let ((.cse10 (* |ULTIMATE.start_main_~len~0#1| 2))) (and .cse0 .cse1 (= .cse6 3) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= 3 |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse10) .cse4 .cse5 (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8) .cse3) .cse7 .cse8 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= .cse10 (+ 2 (select .cse2 (+ |ULTIMATE.start_main_~s~0#1.offset| 8)))) .cse9 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)))))) [2022-12-13 12:14:18,806 INFO L895 garLoopResultBuilder]: At program point dll_circular_create_returnLabel#1(lines 585 600) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= 0 .cse0) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_748 Int) (v_ArrVal_741 (Array Int Int))) (= (select (store (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_748) |ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) [2022-12-13 12:14:18,806 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 12:14:18,806 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-12-13 12:14:18,806 INFO L899 garLoopResultBuilder]: For program point L635-2(lines 635 640) no Hoare annotation was computed. [2022-12-13 12:14:18,807 INFO L895 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse11 (* |ULTIMATE.start_main_~len~0#1| 2))) (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse3 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse4 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse11)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse7 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse8 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse10 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse1 (select .cse10 8))) (and .cse0 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) .cse1) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= .cse1 |ULTIMATE.start_main_~len~0#1|) .cse2 (<= |ULTIMATE.start_main_~len~0#1| .cse1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) .cse7 .cse8 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= .cse11 (+ 2 (select .cse10 (+ |ULTIMATE.start_main_~s~0#1.offset| 8)))) .cse9 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))))) [2022-12-13 12:14:18,807 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2022-12-13 12:14:18,807 INFO L899 garLoopResultBuilder]: For program point L635-4(lines 635 640) no Hoare annotation was computed. [2022-12-13 12:14:18,807 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 625) no Hoare annotation was computed. [2022-12-13 12:14:18,807 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2)) [2022-12-13 12:14:18,807 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2022-12-13 12:14:18,807 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 12:14:18,808 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse19 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse18 (+ |ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (let ((.cse10 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse11 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse6 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse12 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) (.cse13 (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse14 (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|))) (.cse15 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|) |ULTIMATE.start_dll_circular_create_#res#1.base|))) (.cse16 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse17 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) (.cse3 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse4 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_dll_circular_update_at_~data#1|)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse20 (<= .cse19 .cse18)) (.cse22 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse7 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse8 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse23 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (or (let ((.cse2 (select .cse11 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (+ |ULTIMATE.start_main_~len~0#1| 1))) (and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_circular_update_at_~index#1|) (<= .cse1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8)) (not (= .cse2 |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (<= (select (select |#memory_int| .cse2) 8) .cse1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (select .cse10 |ULTIMATE.start_main_~s~0#1.offset|) 0))) (and (= (select .cse10 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 0) .cse0 .cse12 (= |ULTIMATE.start_dll_circular_update_at_~index#1| |ULTIMATE.start_main_~i~0#1|) .cse13 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse14 .cse15 .cse16 .cse17 (<= .cse18 .cse19) .cse4 .cse5 .cse20 (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (let ((.cse21 (select .cse11 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= .cse21 (select (store (select (store |#memory_$Pointer$.base| .cse21 v_ArrVal_742) |ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |ULTIMATE.start_main_~s~0#1.offset|)))))) .cse6 .cse22 .cse7 .cse8 .cse9 .cse23) (and .cse0 .cse12 .cse13 (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_748 Int) (v_ArrVal_741 (Array Int Int))) (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| (select (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_741) |ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_748) |ULTIMATE.start_main_~s~0#1.offset|))))) .cse14 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse15 .cse16 .cse17 (<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_dll_circular_update_at_~index#1| 1)) .cse3 .cse4 .cse5 .cse20 .cse22 (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_742) |ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |ULTIMATE.start_main_~s~0#1.offset|))))) .cse7 .cse8 .cse9 .cse23)))) [2022-12-13 12:14:18,808 INFO L899 garLoopResultBuilder]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2022-12-13 12:14:18,808 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2022-12-13 12:14:18,808 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-12-13 12:14:18,808 INFO L899 garLoopResultBuilder]: For program point L604-3(lines 604 608) no Hoare annotation was computed. [2022-12-13 12:14:18,808 INFO L895 garLoopResultBuilder]: At program point main_ERROR#1(lines 626 645) the Hoare annotation is: false [2022-12-13 12:14:18,808 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) .cse1 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (not .cse2)) (and .cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) .cse1 .cse2))) [2022-12-13 12:14:18,808 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2022-12-13 12:14:18,809 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse22 (* |ULTIMATE.start_main_~len~0#1| 2))) (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0)) (.cse9 (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))) (.cse14 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse15 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse4 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse5 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse17 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse22)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0)) (.cse8 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse18 (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8) .cse3)) (.cse10 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse11 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse19 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse20 (= .cse22 (+ 2 (select .cse2 (+ |ULTIMATE.start_main_~s~0#1.offset| 8))))) (.cse12 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse21 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))) (or (and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) .cse0 .cse1 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= (select .cse2 8) .cse3) .cse4 .cse5 (= .cse3 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse6 .cse7 .cse8 (= .cse9 2) .cse10 .cse11 .cse12) (let ((.cse13 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|)) (.cse16 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) 0))) (and (<= 1 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) .cse0 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1) (= 0 (select .cse13 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) .cse14 .cse15 (= 3 (select (select |#memory_int| .cse16) (+ 8 (select .cse13 0)))) .cse5 .cse17 .cse6 .cse7 (not (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| .cse16)) .cse8 .cse18 .cse10 .cse11 .cse19 .cse20 .cse12 .cse21)) (and .cse0 .cse1 (= .cse9 3) .cse14 .cse15 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse18 .cse10 .cse11 .cse19 .cse20 .cse12 .cse21)))) [2022-12-13 12:14:18,809 INFO L899 garLoopResultBuilder]: For program point L613-3(lines 613 616) no Hoare annotation was computed. [2022-12-13 12:14:18,809 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-12-13 12:14:18,809 INFO L899 garLoopResultBuilder]: For program point L577-1(lines 577 579) no Hoare annotation was computed. [2022-12-13 12:14:18,809 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-12-13 12:14:18,809 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 575 584) no Hoare annotation was computed. [2022-12-13 12:14:18,809 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-12-13 12:14:18,809 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2022-12-13 12:14:18,812 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1] [2022-12-13 12:14:18,814 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:14:18,822 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,823 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,823 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,823 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,823 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,823 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,824 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] [2022-12-13 12:14:18,824 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,824 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] [2022-12-13 12:14:18,824 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,824 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,824 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,827 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,827 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,827 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,827 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,827 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,828 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,828 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] [2022-12-13 12:14:18,828 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,828 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] [2022-12-13 12:14:18,828 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,828 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,828 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,831 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,831 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,831 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,831 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,832 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,832 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,832 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,832 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,832 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,833 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,833 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,833 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,833 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,833 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] [2022-12-13 12:14:18,833 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,834 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] [2022-12-13 12:14:18,834 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,834 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,834 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,835 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,835 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,835 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,835 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] [2022-12-13 12:14:18,835 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] [2022-12-13 12:14:18,836 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,836 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,836 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,836 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,836 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,837 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,837 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] [2022-12-13 12:14:18,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] [2022-12-13 12:14:18,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,840 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,840 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,840 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,841 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,841 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,841 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,841 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,841 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,842 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,842 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,842 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,842 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,842 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,842 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] [2022-12-13 12:14:18,843 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,843 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] [2022-12-13 12:14:18,843 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,843 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,843 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,844 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,844 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,844 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,844 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] [2022-12-13 12:14:18,844 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] [2022-12-13 12:14:18,844 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,845 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,845 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,845 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,845 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,845 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,845 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,846 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,846 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] [2022-12-13 12:14:18,846 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] [2022-12-13 12:14:18,846 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,849 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,849 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,850 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,850 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,851 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,852 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,853 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,853 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,854 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,854 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,854 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,855 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,855 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,855 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,855 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,855 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,855 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,856 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,856 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,856 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] [2022-12-13 12:14:18,856 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,856 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] [2022-12-13 12:14:18,856 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,857 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,857 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,857 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,857 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,857 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,859 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,859 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,859 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,859 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,859 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,859 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,860 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,860 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,860 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,860 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,860 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,860 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] [2022-12-13 12:14:18,861 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,861 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] [2022-12-13 12:14:18,861 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,861 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,861 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,861 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,861 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,862 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,863 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,863 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,863 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,863 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,864 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,864 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,864 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,864 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,865 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,865 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,865 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,866 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,866 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,866 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,866 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,866 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,867 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,868 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,868 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,868 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,868 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,868 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,868 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,869 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:14:18 BoogieIcfgContainer [2022-12-13 12:14:18,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:14:18,870 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:14:18,870 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:14:18,870 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:14:18,871 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:14:00" (3/4) ... [2022-12-13 12:14:18,873 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 12:14:18,879 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-12-13 12:14:18,883 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-12-13 12:14:18,883 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-12-13 12:14:18,884 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 12:14:18,884 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 12:14:18,900 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((head == 0 && #memory_$Pointer$[head][head] == 0) && last == #memory_$Pointer$[head][head]) && 0 == #memory_$Pointer$[\result][\result]) && !(new_head == last)) && #memory_$Pointer$[new_head][new_head] == 0) && len == 2) && #memory_$Pointer$[new_head][new_head] == last) && (forall v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 : int :: (forall v_ArrVal_748 : int, v_ArrVal_741 : [int]int :: #memory_$Pointer$[#memory_$Pointer$[\result][\result] := v_ArrVal_741][\result][v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 + 8 := v_ArrVal_748][\result] == #memory_$Pointer$[\result][\result]) || v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 < \result)) && \result == 0) && new_head == 0) && !(head == last) [2022-12-13 12:14:18,900 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((head == 0 && unknown-#memory_int-unknown[s][8] <= len) && s == head) && i <= index) && len <= unknown-#memory_int-unknown[s][8]) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][8] <= len + 1) && index <= 0) && 2 + data == len * 2) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) && #memory_$Pointer$[head][s] == 0) || (((((((((((((((head == 0 && #memory_$Pointer$[head][head] == 0) && last == #memory_$Pointer$[head][head]) && i == 1) && 0 == #memory_$Pointer$[\result][\result]) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && !(new_head == last)) && #memory_$Pointer$[new_head][new_head] == 0) && len == 2) && (forall v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 : int :: v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 < s || (forall v_ArrVal_747 : int, v_ArrVal_742 : [int]int :: !(#memory_$Pointer$[#memory_$Pointer$[s][s] := v_ArrVal_742][s][v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 + 8 := v_ArrVal_747][s] == s)))) && #memory_$Pointer$[new_head][new_head] == last) && \result == 0) && new_head == 0) && s == 0) && !(head == last))) || (((((((((((head == 0 && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + 1) && i <= index) && #memory_$Pointer$[s][s] == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && 0 <= i) && index <= 0) && len == 2) && \result == 0) && new_head == 0) && s == 0) [2022-12-13 12:14:18,901 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((head == 0 && 2 + i <= unknown-#memory_int-unknown[s][8]) && index <= 0) && unknown-#memory_int-unknown[s][8] <= len) && s == head) && len <= unknown-#memory_int-unknown[s][8]) && index <= 0) && 2 + data == len * 2) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) || ((((((((((((head == 0 && s == head) && index <= 0) && 2 + data == len * 2) && len == 2) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0) [2022-12-13 12:14:18,901 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((head == 0 && head == 0) && i == 0) && i <= index) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && !(#memory_$Pointer$[head][s] == head)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][8] <= len + 1) && index <= 0) && len + i == data) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) && #memory_$Pointer$[head][s] == 0) || ((((((((((((((((((((#memory_$Pointer$[head][head] == 0 && head == 0) && #memory_$Pointer$[head][head] == 0) && index == i) && last == #memory_$Pointer$[head][head]) && s == head) && 0 == #memory_$Pointer$[\result][\result]) && !(#memory_$Pointer$[\result][\result] == \result)) && !(new_head == last)) && #memory_$Pointer$[new_head][new_head] == 0) && data + 1 <= len * 2) && len + i == data) && len == 2) && len * 2 <= data + 1) && (forall v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 : int :: v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 < s || (forall v_ArrVal_747 : int, v_ArrVal_742 : [int]int :: #memory_$Pointer$[head][head] == #memory_$Pointer$[#memory_$Pointer$[head][head] := v_ArrVal_742][s][v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 + 8 := v_ArrVal_747][s]))) && head == s) && #memory_$Pointer$[new_head][new_head] == last) && \result == 0) && new_head == 0) && s == 0) && !(head == last))) || (((((((((((((((((((head == 0 && #memory_$Pointer$[head][head] == 0) && last == #memory_$Pointer$[head][head]) && (forall v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 : int :: v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 < s || (forall v_ArrVal_748 : int, v_ArrVal_741 : [int]int :: head == #memory_$Pointer$[head := v_ArrVal_741][s][v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 + 8 := v_ArrVal_748][s]))) && 0 == #memory_$Pointer$[\result][\result]) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && !(new_head == last)) && #memory_$Pointer$[new_head][new_head] == 0) && i <= index + 1) && index <= 0) && len + i == data) && len == 2) && len * 2 <= data + 1) && #memory_$Pointer$[new_head][new_head] == last) && (forall v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 : int :: v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 < s || (forall v_ArrVal_747 : int, v_ArrVal_742 : [int]int :: head == #memory_$Pointer$[head := v_ArrVal_742][s][v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 + 8 := v_ArrVal_747][s]))) && \result == 0) && new_head == 0) && s == 0) && !(head == last)) [2022-12-13 12:14:18,901 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((head == 0 && head == 0) && index <= 0) && 2 + i <= len) && 2 == expected) && unknown-#memory_int-unknown[s][8] == len + i) && 0 <= i) && index <= 0) && len + i == data) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[head][8 + head] == 2) && \result == 0) && new_head == 0) && s == 0) || (((((((((((((((((((1 <= index && head == 0) && index <= 1) && 0 == #memory_$Pointer$[head][head]) && s == head) && 3 == expected) && 3 == unknown-#memory_int-unknown[#memory_$Pointer$[head][0]][8 + #memory_$Pointer$[head][0]]) && index <= 0) && 2 + data == len * 2) && len == 2) && head == 0) && !(head == #memory_$Pointer$[head][0])) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0)) || (((((((((((((((((head == 0 && index <= 0) && unknown-#memory_int-unknown[head][8 + head] == 3) && s == head) && 3 == expected) && 0 <= i) && index <= 0) && 2 + data == len * 2) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0) [2022-12-13 12:14:18,901 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (index <= 0 && len == 2) && ((((((((((((((head == 0 && head == 0) && i == 0) && index <= 0) && 2 == expected) && 2 == \result) && unknown-#memory_int-unknown[s][8] == len + i) && len + i == data) && head == 0) && head == s) && unknown-#memory_int-unknown[head][8 + head] == 2) && \result == 0) && new_head == 0) && s == 0) || (((((((((((((((head == 0 && index <= 0) && unknown-#memory_int-unknown[head][8 + head] == 3) && s == head) && 3 == \result) && 3 == expected) && 2 + data == len * 2) && head == 0) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0)) [2022-12-13 12:14:18,909 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 12:14:18,909 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:14:18,909 INFO L158 Benchmark]: Toolchain (without parser) took 19388.56ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 114.5MB in the beginning and 124.4MB in the end (delta: -9.9MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2022-12-13 12:14:18,910 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory was 75.5MB in the beginning and 75.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:14:18,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.67ms. Allocated memory is still 155.2MB. Free memory was 113.8MB in the beginning and 115.5MB in the end (delta: -1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 12:14:18,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.20ms. Allocated memory is still 155.2MB. Free memory was 115.5MB in the beginning and 113.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:14:18,910 INFO L158 Benchmark]: Boogie Preprocessor took 27.93ms. Allocated memory is still 155.2MB. Free memory was 113.4MB in the beginning and 112.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:14:18,910 INFO L158 Benchmark]: RCFGBuilder took 291.75ms. Allocated memory is still 155.2MB. Free memory was 112.0MB in the beginning and 95.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 12:14:18,910 INFO L158 Benchmark]: TraceAbstraction took 18666.70ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 95.2MB in the beginning and 128.6MB in the end (delta: -33.4MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. [2022-12-13 12:14:18,911 INFO L158 Benchmark]: Witness Printer took 38.95ms. Allocated memory is still 224.4MB. Free memory was 128.6MB in the beginning and 124.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 12:14:18,911 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory was 75.5MB in the beginning and 75.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.67ms. Allocated memory is still 155.2MB. Free memory was 113.8MB in the beginning and 115.5MB in the end (delta: -1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.20ms. Allocated memory is still 155.2MB. Free memory was 115.5MB in the beginning and 113.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.93ms. Allocated memory is still 155.2MB. Free memory was 113.4MB in the beginning and 112.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 291.75ms. Allocated memory is still 155.2MB. Free memory was 112.0MB in the beginning and 95.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18666.70ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 95.2MB in the beginning and 128.6MB in the end (delta: -33.4MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. * Witness Printer took 38.95ms. Allocated memory is still 224.4MB. Free memory was 128.6MB in the beginning and 124.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 643]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.6s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1012 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1010 mSDsluCounter, 2427 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 449 IncrementalHoareTripleChecker+Unchecked, 2014 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2377 IncrementalHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 413 mSDtfsCounter, 2377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 831 GetRequests, 588 SyntacticMatches, 21 SemanticMatches, 222 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2434 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=12, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 112 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 18 PreInvPairs, 38 NumberOfFragments, 1345 HoareAnnotationTreeSize, 18 FomulaSimplifications, 5577 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 1799 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 911 NumberOfCodeBlocks, 885 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1149 ConstructedInterpolants, 15 QuantifiedInterpolants, 6924 SizeOfPredicates, 75 NumberOfNonLiveVariables, 2766 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 401/514 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 585]: Loop Invariant [2022-12-13 12:14:18,917 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,917 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,917 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,917 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,917 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,917 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] [2022-12-13 12:14:18,917 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] [2022-12-13 12:14:18,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,918 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,918 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,918 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,918 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,918 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,918 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,918 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,918 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,918 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] [2022-12-13 12:14:18,918 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,919 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] [2022-12-13 12:14:18,919 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,919 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,919 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] Derived loop invariant: ((((((((((head == 0 && #memory_$Pointer$[head][head] == 0) && last == #memory_$Pointer$[head][head]) && 0 == #memory_$Pointer$[\result][\result]) && !(new_head == last)) && #memory_$Pointer$[new_head][new_head] == 0) && len == 2) && #memory_$Pointer$[new_head][new_head] == last) && (forall v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 : int :: (forall v_ArrVal_748 : int, v_ArrVal_741 : [int]int :: #memory_$Pointer$[#memory_$Pointer$[\result][\result] := v_ArrVal_741][\result][v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 + 8 := v_ArrVal_748][\result] == #memory_$Pointer$[\result][\result]) || v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 < \result)) && \result == 0) && new_head == 0) && !(head == last) - InvariantResult [Line: 620]: Loop Invariant [2022-12-13 12:14:18,919 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,919 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,919 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,919 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,919 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] [2022-12-13 12:14:18,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] [2022-12-13 12:14:18,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] [2022-12-13 12:14:18,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] [2022-12-13 12:14:18,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,922 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,922 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,922 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,922 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] [2022-12-13 12:14:18,922 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] [2022-12-13 12:14:18,922 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] [2022-12-13 12:14:18,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] [2022-12-13 12:14:18,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] [2022-12-13 12:14:18,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] [2022-12-13 12:14:18,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] [2022-12-13 12:14:18,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] [2022-12-13 12:14:18,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] Derived loop invariant: (((((((((((((((head == 0 && head == 0) && i == 0) && i <= index) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && !(#memory_$Pointer$[head][s] == head)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][8] <= len + 1) && index <= 0) && len + i == data) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) && #memory_$Pointer$[head][s] == 0) || ((((((((((((((((((((#memory_$Pointer$[head][head] == 0 && head == 0) && #memory_$Pointer$[head][head] == 0) && index == i) && last == #memory_$Pointer$[head][head]) && s == head) && 0 == #memory_$Pointer$[\result][\result]) && !(#memory_$Pointer$[\result][\result] == \result)) && !(new_head == last)) && #memory_$Pointer$[new_head][new_head] == 0) && data + 1 <= len * 2) && len + i == data) && len == 2) && len * 2 <= data + 1) && (forall v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 : int :: v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 < s || (forall v_ArrVal_747 : int, v_ArrVal_742 : [int]int :: #memory_$Pointer$[head][head] == #memory_$Pointer$[#memory_$Pointer$[head][head] := v_ArrVal_742][s][v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 + 8 := v_ArrVal_747][s]))) && head == s) && #memory_$Pointer$[new_head][new_head] == last) && \result == 0) && new_head == 0) && s == 0) && !(head == last))) || (((((((((((((((((((head == 0 && #memory_$Pointer$[head][head] == 0) && last == #memory_$Pointer$[head][head]) && (forall v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 : int :: v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 < s || (forall v_ArrVal_748 : int, v_ArrVal_741 : [int]int :: head == #memory_$Pointer$[head := v_ArrVal_741][s][v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 + 8 := v_ArrVal_748][s]))) && 0 == #memory_$Pointer$[\result][\result]) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && !(new_head == last)) && #memory_$Pointer$[new_head][new_head] == 0) && i <= index + 1) && index <= 0) && len + i == data) && len == 2) && len * 2 <= data + 1) && #memory_$Pointer$[new_head][new_head] == last) && (forall v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 : int :: v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 < s || (forall v_ArrVal_747 : int, v_ArrVal_742 : [int]int :: head == #memory_$Pointer$[head := v_ArrVal_742][s][v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 + 8 := v_ArrVal_747][s]))) && \result == 0) && new_head == 0) && s == 0) && !(head == last)) - InvariantResult [Line: 635]: Loop Invariant [2022-12-13 12:14:18,926 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,927 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,927 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,927 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((head == 0 && 2 + i <= unknown-#memory_int-unknown[s][8]) && index <= 0) && unknown-#memory_int-unknown[s][8] <= len) && s == head) && len <= unknown-#memory_int-unknown[s][8]) && index <= 0) && 2 + data == len * 2) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) || ((((((((((((head == 0 && s == head) && index <= 0) && 2 + data == len * 2) && len == 2) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 612]: Loop Invariant [2022-12-13 12:14:18,927 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,927 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,928 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,928 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (index <= 0 && len == 2) && ((((((((((((((head == 0 && head == 0) && i == 0) && index <= 0) && 2 == expected) && 2 == \result) && unknown-#memory_int-unknown[s][8] == len + i) && len + i == data) && head == 0) && head == s) && unknown-#memory_int-unknown[head][8 + head] == 2) && \result == 0) && new_head == 0) && s == 0) || (((((((((((((((head == 0 && index <= 0) && unknown-#memory_int-unknown[head][8 + head] == 3) && s == head) && 3 == \result) && 3 == expected) && 2 + data == len * 2) && head == 0) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0)) - InvariantResult [Line: 631]: Loop Invariant [2022-12-13 12:14:18,928 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,928 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] [2022-12-13 12:14:18,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] [2022-12-13 12:14:18,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,931 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,931 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_742,QUANTIFIED] [2022-12-13 12:14:18,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,931 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_747,QUANTIFIED] [2022-12-13 12:14:18,931 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-12-13 12:14:18,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((head == 0 && unknown-#memory_int-unknown[s][8] <= len) && s == head) && i <= index) && len <= unknown-#memory_int-unknown[s][8]) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][8] <= len + 1) && index <= 0) && 2 + data == len * 2) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) && #memory_$Pointer$[head][s] == 0) || (((((((((((((((head == 0 && #memory_$Pointer$[head][head] == 0) && last == #memory_$Pointer$[head][head]) && i == 1) && 0 == #memory_$Pointer$[\result][\result]) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && !(new_head == last)) && #memory_$Pointer$[new_head][new_head] == 0) && len == 2) && (forall v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 : int :: v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 < s || (forall v_ArrVal_747 : int, v_ArrVal_742 : [int]int :: !(#memory_$Pointer$[#memory_$Pointer$[s][s] := v_ArrVal_742][s][v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 + 8 := v_ArrVal_747][s] == s)))) && #memory_$Pointer$[new_head][new_head] == last) && \result == 0) && new_head == 0) && s == 0) && !(head == last))) || (((((((((((head == 0 && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + 1) && i <= index) && #memory_$Pointer$[s][s] == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && 0 <= i) && index <= 0) && len == 2) && \result == 0) && new_head == 0) && s == 0) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 588]: Loop Invariant [2022-12-13 12:14:18,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((head == 0 && #memory_$Pointer$[head][head] == 0) && last == #memory_$Pointer$[head][head]) && !(new_head == last)) && #memory_$Pointer$[new_head][new_head] == 0) && len == 2) && #memory_$Pointer$[new_head][new_head] == last) && new_head == 0) && len <= 1) && !(head == last)) || ((((head == 0 && \valid[head] == 1) && 2 == len) && len == 2) && head == last) - InvariantResult [Line: 613]: Loop Invariant [2022-12-13 12:14:18,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:14:18,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:14:18,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((head == 0 && head == 0) && index <= 0) && 2 + i <= len) && 2 == expected) && unknown-#memory_int-unknown[s][8] == len + i) && 0 <= i) && index <= 0) && len + i == data) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[head][8 + head] == 2) && \result == 0) && new_head == 0) && s == 0) || (((((((((((((((((((1 <= index && head == 0) && index <= 1) && 0 == #memory_$Pointer$[head][head]) && s == head) && 3 == expected) && 3 == unknown-#memory_int-unknown[#memory_$Pointer$[head][0]][8 + #memory_$Pointer$[head][0]]) && index <= 0) && 2 + data == len * 2) && len == 2) && head == 0) && !(head == #memory_$Pointer$[head][0])) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0)) || (((((((((((((((((head == 0 && index <= 0) && unknown-#memory_int-unknown[head][8 + head] == 3) && s == head) && 3 == expected) && 0 <= i) && index <= 0) && 2 + data == len * 2) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-13 12:14:18,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a0df784-0ede-46ec-ba2b-0b4c58e050d2/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE