./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 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/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_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF --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 --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 05:53:57,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 05:53:57,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 05:53:57,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 05:53:57,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 05:53:57,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 05:53:57,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 05:53:57,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 05:53:57,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 05:53:57,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 05:53:57,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 05:53:57,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 05:53:57,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 05:53:57,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 05:53:57,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 05:53:57,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 05:53:57,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 05:53:57,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 05:53:57,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 05:53:57,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 05:53:57,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 05:53:57,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 05:53:57,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 05:53:57,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 05:53:57,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 05:53:57,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 05:53:57,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 05:53:57,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 05:53:57,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 05:53:57,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 05:53:57,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 05:53:57,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 05:53:57,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 05:53:57,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 05:53:57,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 05:53:57,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 05:53:57,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 05:53:57,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 05:53:57,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 05:53:57,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 05:53:57,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 05:53:57,338 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 05:53:57,392 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 05:53:57,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 05:53:57,393 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 05:53:57,393 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 05:53:57,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 05:53:57,396 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 05:53:57,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 05:53:57,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 05:53:57,398 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 05:53:57,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 05:53:57,400 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 05:53:57,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 05:53:57,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 05:53:57,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 05:53:57,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 05:53:57,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 05:53:57,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 05:53:57,402 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 05:53:57,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 05:53:57,402 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 05:53:57,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 05:53:57,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 05:53:57,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 05:53:57,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 05:53:57,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:53:57,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 05:53:57,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 05:53:57,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 05:53:57,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 05:53:57,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 05:53:57,409 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 05:53:57,409 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 05:53:57,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 05:53:57,410 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 05:53:57,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 [2021-11-20 05:53:57,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 05:53:57,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 05:53:57,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 05:53:57,762 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 05:53:57,763 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 05:53:57,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2021-11-20 05:53:57,844 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/data/9bdf81369/7fa9749b2071477487ce017b01cc540e/FLAGd3c03e74e [2021-11-20 05:53:58,590 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 05:53:58,594 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2021-11-20 05:53:58,626 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/data/9bdf81369/7fa9749b2071477487ce017b01cc540e/FLAGd3c03e74e [2021-11-20 05:53:58,849 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/data/9bdf81369/7fa9749b2071477487ce017b01cc540e [2021-11-20 05:53:58,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 05:53:58,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 05:53:58,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 05:53:58,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 05:53:58,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 05:53:58,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:53:58" (1/1) ... [2021-11-20 05:53:58,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc9d1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:58, skipping insertion in model container [2021-11-20 05:53:58,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:53:58" (1/1) ... [2021-11-20 05:53:58,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 05:53:58,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 05:53:59,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2021-11-20 05:53:59,354 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:53:59,367 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 05:53:59,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2021-11-20 05:53:59,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:53:59,514 INFO L208 MainTranslator]: Completed translation [2021-11-20 05:53:59,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:59 WrapperNode [2021-11-20 05:53:59,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 05:53:59,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 05:53:59,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 05:53:59,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 05:53:59,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:59" (1/1) ... [2021-11-20 05:53:59,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:59" (1/1) ... [2021-11-20 05:53:59,621 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2021-11-20 05:53:59,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 05:53:59,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 05:53:59,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 05:53:59,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 05:53:59,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:59" (1/1) ... [2021-11-20 05:53:59,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:59" (1/1) ... [2021-11-20 05:53:59,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:59" (1/1) ... [2021-11-20 05:53:59,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:59" (1/1) ... [2021-11-20 05:53:59,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:59" (1/1) ... [2021-11-20 05:53:59,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:59" (1/1) ... [2021-11-20 05:53:59,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:59" (1/1) ... [2021-11-20 05:53:59,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 05:53:59,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 05:53:59,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 05:53:59,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 05:53:59,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:59" (1/1) ... [2021-11-20 05:53:59,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:53:59,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:53:59,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 05:53:59,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 05:53:59,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 05:53:59,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 05:53:59,780 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-20 05:53:59,780 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-20 05:53:59,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 05:53:59,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 05:53:59,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 05:53:59,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 05:53:59,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 05:53:59,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 05:53:59,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 05:53:59,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 05:53:59,980 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 05:53:59,996 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 05:54:00,284 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 05:54:00,292 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 05:54:00,292 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-20 05:54:00,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:54:00 BoogieIcfgContainer [2021-11-20 05:54:00,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 05:54:00,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 05:54:00,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 05:54:00,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 05:54:00,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:53:58" (1/3) ... [2021-11-20 05:54:00,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45dc964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:54:00, skipping insertion in model container [2021-11-20 05:54:00,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:59" (2/3) ... [2021-11-20 05:54:00,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45dc964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:54:00, skipping insertion in model container [2021-11-20 05:54:00,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:54:00" (3/3) ... [2021-11-20 05:54:00,309 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2021-11-20 05:54:00,316 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 05:54:00,317 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 05:54:00,391 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 05:54:00,403 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 05:54:00,404 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 05:54:00,443 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) [2021-11-20 05:54:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-20 05:54:00,454 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:54:00,456 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:54:00,456 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:54:00,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:54:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1387430191, now seen corresponding path program 1 times [2021-11-20 05:54:00,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:54:00,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541112778] [2021-11-20 05:54:00,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:00,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:54:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:54:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:54:00,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:54:00,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541112778] [2021-11-20 05:54:00,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541112778] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:54:00,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:54:00,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 05:54:00,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112351381] [2021-11-20 05:54:00,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:54:00,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 05:54:00,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:54:00,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 05:54:00,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 05:54:00,968 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) [2021-11-20 05:54:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:54:01,067 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2021-11-20 05:54:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 05:54:01,071 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 [2021-11-20 05:54:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:54:01,081 INFO L225 Difference]: With dead ends: 63 [2021-11-20 05:54:01,081 INFO L226 Difference]: Without dead ends: 30 [2021-11-20 05:54:01,085 INFO L932 BasicCegarLoop]: 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 [2021-11-20 05:54:01,093 INFO L933 BasicCegarLoop]: 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 [2021-11-20 05:54:01,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:54:01,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-20 05:54:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-11-20 05:54:01,155 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) [2021-11-20 05:54:01,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-11-20 05:54:01,159 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2021-11-20 05:54:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:54:01,161 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-11-20 05:54:01,161 INFO L471 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) [2021-11-20 05:54:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-11-20 05:54:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-20 05:54:01,164 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:54:01,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:54:01,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 05:54:01,167 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:54:01,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:54:01,171 INFO L85 PathProgramCache]: Analyzing trace with hash 498100996, now seen corresponding path program 1 times [2021-11-20 05:54:01,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:54:01,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876151842] [2021-11-20 05:54:01,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:01,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:54:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:01,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:54:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:54:01,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:54:01,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876151842] [2021-11-20 05:54:01,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876151842] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:54:01,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:54:01,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 05:54:01,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91664540] [2021-11-20 05:54:01,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:54:01,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 05:54:01,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:54:01,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 05:54:01,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 05:54:01,342 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) [2021-11-20 05:54:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:54:01,406 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2021-11-20 05:54:01,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 05:54:01,409 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 [2021-11-20 05:54:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:54:01,412 INFO L225 Difference]: With dead ends: 51 [2021-11-20 05:54:01,412 INFO L226 Difference]: Without dead ends: 35 [2021-11-20 05:54:01,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 05:54:01,422 INFO L933 BasicCegarLoop]: 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 [2021-11-20 05:54:01,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:54:01,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-20 05:54:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2021-11-20 05:54:01,440 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) [2021-11-20 05:54:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2021-11-20 05:54:01,441 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2021-11-20 05:54:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:54:01,441 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2021-11-20 05:54:01,442 INFO L471 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) [2021-11-20 05:54:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2021-11-20 05:54:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 05:54:01,443 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:54:01,444 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:54:01,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 05:54:01,444 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:54:01,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:54:01,445 INFO L85 PathProgramCache]: Analyzing trace with hash 698671896, now seen corresponding path program 1 times [2021-11-20 05:54:01,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:54:01,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61420636] [2021-11-20 05:54:01,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:01,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:54:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:01,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:54:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:01,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:54:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:54:01,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:54:01,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61420636] [2021-11-20 05:54:01,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61420636] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:54:01,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:54:01,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 05:54:01,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566892014] [2021-11-20 05:54:01,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:54:01,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:54:01,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:54:01,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:54:01,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:54:01,657 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) [2021-11-20 05:54:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:54:01,776 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2021-11-20 05:54:01,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 05:54:01,777 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 [2021-11-20 05:54:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:54:01,781 INFO L225 Difference]: With dead ends: 53 [2021-11-20 05:54:01,781 INFO L226 Difference]: Without dead ends: 44 [2021-11-20 05:54:01,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:54:01,791 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:54:01,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 72 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 05:54:01,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-11-20 05:54:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2021-11-20 05:54:01,799 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) [2021-11-20 05:54:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-11-20 05:54:01,801 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 30 [2021-11-20 05:54:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:54:01,801 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-11-20 05:54:01,802 INFO L471 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) [2021-11-20 05:54:01,809 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-11-20 05:54:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-20 05:54:01,812 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:54:01,812 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:54:01,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 05:54:01,813 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:54:01,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:54:01,813 INFO L85 PathProgramCache]: Analyzing trace with hash 143562896, now seen corresponding path program 1 times [2021-11-20 05:54:01,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:54:01,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851049806] [2021-11-20 05:54:01,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:01,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:54:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:01,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:54:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:01,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:54:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:54:02,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:54:02,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851049806] [2021-11-20 05:54:02,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851049806] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:54:02,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:54:02,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 05:54:02,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753251206] [2021-11-20 05:54:02,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:54:02,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:54:02,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:54:02,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:54:02,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:54:02,012 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) [2021-11-20 05:54:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:54:02,141 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2021-11-20 05:54:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 05:54:02,142 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 [2021-11-20 05:54:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:54:02,144 INFO L225 Difference]: With dead ends: 59 [2021-11-20 05:54:02,147 INFO L226 Difference]: Without dead ends: 45 [2021-11-20 05:54:02,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:54:02,151 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 45 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:54:02,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 89 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 05:54:02,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-20 05:54:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2021-11-20 05:54:02,160 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) [2021-11-20 05:54:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2021-11-20 05:54:02,161 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 35 [2021-11-20 05:54:02,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:54:02,162 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2021-11-20 05:54:02,162 INFO L471 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) [2021-11-20 05:54:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2021-11-20 05:54:02,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 05:54:02,164 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:54:02,164 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:54:02,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 05:54:02,165 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:54:02,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:54:02,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1641789207, now seen corresponding path program 1 times [2021-11-20 05:54:02,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:54:02,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251280631] [2021-11-20 05:54:02,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:02,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:54:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:02,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:54:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:02,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:54:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 05:54:02,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:54:02,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251280631] [2021-11-20 05:54:02,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251280631] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:54:02,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595569869] [2021-11-20 05:54:02,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:02,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:54:02,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:54:02,353 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:54:02,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 05:54:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:02,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 05:54:02,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:54:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 05:54:02,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:54:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 05:54:02,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595569869] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:54:02,918 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:54:02,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-11-20 05:54:02,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416591086] [2021-11-20 05:54:02,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:54:02,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 05:54:02,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:54:02,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 05:54:02,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-20 05:54:02,923 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 05:54:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:54:03,029 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2021-11-20 05:54:03,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 05:54:03,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 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 [2021-11-20 05:54:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:54:03,032 INFO L225 Difference]: With dead ends: 56 [2021-11-20 05:54:03,032 INFO L226 Difference]: Without dead ends: 47 [2021-11-20 05:54:03,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-20 05:54:03,034 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 92 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:54:03,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 102 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 05:54:03,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-11-20 05:54:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2021-11-20 05:54:03,055 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) [2021-11-20 05:54:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2021-11-20 05:54:03,056 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 36 [2021-11-20 05:54:03,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:54:03,057 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2021-11-20 05:54:03,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 05:54:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2021-11-20 05:54:03,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-20 05:54:03,059 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:54:03,062 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:54:03,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 05:54:03,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:54:03,287 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:54:03,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:54:03,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1233857887, now seen corresponding path program 2 times [2021-11-20 05:54:03,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:54:03,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281497278] [2021-11-20 05:54:03,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:03,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:54:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:03,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:54:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:03,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:54:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-20 05:54:03,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:54:03,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281497278] [2021-11-20 05:54:03,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281497278] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:54:03,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:54:03,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 05:54:03,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206910975] [2021-11-20 05:54:03,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:54:03,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:54:03,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:54:03,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:54:03,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:54:03,445 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) [2021-11-20 05:54:03,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:54:03,545 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2021-11-20 05:54:03,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 05:54:03,546 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 [2021-11-20 05:54:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:54:03,552 INFO L225 Difference]: With dead ends: 55 [2021-11-20 05:54:03,553 INFO L226 Difference]: Without dead ends: 47 [2021-11-20 05:54:03,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:54:03,562 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 24 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:54:03,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 104 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 05:54:03,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-11-20 05:54:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2021-11-20 05:54:03,580 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) [2021-11-20 05:54:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2021-11-20 05:54:03,583 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 41 [2021-11-20 05:54:03,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:54:03,585 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2021-11-20 05:54:03,585 INFO L471 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) [2021-11-20 05:54:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2021-11-20 05:54:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-20 05:54:03,591 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:54:03,592 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:54:03,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 05:54:03,592 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:54:03,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:54:03,593 INFO L85 PathProgramCache]: Analyzing trace with hash -353457273, now seen corresponding path program 1 times [2021-11-20 05:54:03,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:54:03,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590611378] [2021-11-20 05:54:03,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:03,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:54:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:04,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:54:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:04,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:54:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:54:04,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:54:04,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590611378] [2021-11-20 05:54:04,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590611378] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:54:04,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042631985] [2021-11-20 05:54:04,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:04,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:54:04,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:54:04,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:54:04,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 05:54:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:05,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-20 05:54:05,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:54:05,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 05:54:05,422 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 05:54:05,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-20 05:54:05,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-20 05:54:05,597 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-20 05:54:05,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2021-11-20 05:54:05,911 INFO L354 Elim1Store]: treesize reduction 122, result has 16.4 percent of original size [2021-11-20 05:54:05,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 68 [2021-11-20 05:54:05,940 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-20 05:54:05,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 62 [2021-11-20 05:54:13,281 INFO L354 Elim1Store]: treesize reduction 335, result has 15.6 percent of original size [2021-11-20 05:54:13,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 170 treesize of output 163 [2021-11-20 05:54:13,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 147 [2021-11-20 05:54:13,352 INFO L354 Elim1Store]: treesize reduction 142, result has 17.4 percent of original size [2021-11-20 05:54:13,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 147 treesize of output 134 [2021-11-20 05:54:14,022 INFO L354 Elim1Store]: treesize reduction 130, result has 16.7 percent of original size [2021-11-20 05:54:14,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 130 [2021-11-20 05:54:14,051 INFO L354 Elim1Store]: treesize reduction 59, result has 22.4 percent of original size [2021-11-20 05:54:14,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 133 [2021-11-20 05:54:14,099 INFO L354 Elim1Store]: treesize reduction 130, result has 16.7 percent of original size [2021-11-20 05:54:14,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 94 [2021-11-20 05:54:14,839 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-20 05:54:14,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 102 [2021-11-20 05:54:14,857 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-20 05:54:14,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 60 [2021-11-20 05:54:15,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2021-11-20 05:54:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 05:54:15,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:54:36,454 WARN L838 $PredicateComparison]: unable to prove that (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|) (and (forall ((|ULTIMATE.start_dll_circular_update_at_~data#1| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse0 (+ |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| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 |ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1))) (forall ((|ULTIMATE.start_dll_circular_update_at_~data#1| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (<= (+ (let ((.cse1 (+ |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| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 |ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)))))) is different from false [2021-11-20 05:54:36,616 INFO L354 Elim1Store]: treesize reduction 47, result has 7.8 percent of original size [2021-11-20 05:54:36,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1121 treesize of output 1029 [2021-11-20 05:54:40,482 WARN L838 $PredicateComparison]: unable to prove that (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|) (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (or (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (not (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_1 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (<= .cse0 .cse1) (or (forall ((v_prenex_1 Int) (v_DerPreprocessor_3 Int)) (not (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_prenex_2 Int) (v_DerPreprocessor_4 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_3 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| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_prenex_2 Int) (v_DerPreprocessor_4 Int)) (let ((.cse2 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (forall ((v_prenex_1 Int) (v_DerPreprocessor_3 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| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse2 |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|)))) (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (forall ((v_prenex_2 Int) (v_DerPreprocessor_4 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_3 Int)) (let ((.cse3 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| .cse3) (and (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset| .cse3) (forall ((v_prenex_2 Int) (v_DerPreprocessor_4 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)))))) (<= .cse1 .cse0))))) is different from false [2021-11-20 05:54:43,612 WARN L838 $PredicateComparison]: unable to prove that (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|) (let ((.cse6 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.cse5 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (or (forall ((v_prenex_1 Int) (v_DerPreprocessor_3 Int)) (not (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| (select (store (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) (+ (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|) 8) v_DerPreprocessor_3))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_prenex_2 Int) (v_DerPreprocessor_4 Int)) (not (= (select (store (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ (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|) 8) v_DerPreprocessor_4))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_1 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (+ (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|) 8) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse4 (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 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) (+ .cse4 8) v_DerPreprocessor_3))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse4))) (<= .cse5 .cse6) (forall ((v_prenex_2 Int) (v_DerPreprocessor_4 Int)) (let ((.cse8 (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|))) (let ((.cse7 (select (store (select (store |c_#memory_$Pointer$.base| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) (+ (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|) 8) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) (and (= .cse7 .cse8) (forall ((v_prenex_1 Int) (v_DerPreprocessor_3 Int)) (let ((.cse10 (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 (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse9 (store (select |c_#memory_$Pointer$.offset| .cse9) (+ .cse10 8) v_DerPreprocessor_3))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse10)))))))) (or (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_1 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse11 (store (select |c_#memory_$Pointer$.base| .cse11) (+ (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|) 8) v_DerPreprocessor_4))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (not (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| (select (store (select (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse12 (store (select |c_#memory_$Pointer$.offset| .cse12) (+ (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|) 8) v_DerPreprocessor_3))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_3 Int)) (let ((.cse14 (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|))) (let ((.cse13 (select (store (select (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse16 (store (select |c_#memory_$Pointer$.offset| .cse16) (+ .cse14 8) v_DerPreprocessor_3))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (= .cse13 .cse14) (forall ((v_prenex_2 Int) (v_DerPreprocessor_4 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse15 (store (select |c_#memory_$Pointer$.base| .cse15) (+ (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|) 8) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse15)))) (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| .cse13))))) (forall ((v_prenex_2 Int) (v_DerPreprocessor_4 Int)) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse17 (store (select |c_#memory_$Pointer$.base| .cse17) (+ (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|) 8) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse17))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_3 Int)) (let ((.cse19 (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 (let ((.cse18 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse18 (store (select |c_#memory_$Pointer$.offset| .cse18) (+ .cse19 8) v_DerPreprocessor_3))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse19))) (<= .cse6 .cse5))))) is different from false [2021-11-20 05:54:46,126 WARN L838 $PredicateComparison]: unable to prove that (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|) (let ((.cse6 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((v_prenex_1 Int) (v_DerPreprocessor_3 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (select (store (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) (+ .cse1 8) v_DerPreprocessor_3))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| .cse0) (and (= .cse0 .cse1) (forall ((v_prenex_2 Int) (v_DerPreprocessor_4 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse2)))))))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_3 Int)) (let ((.cse5 (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 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) (+ .cse5 8) v_DerPreprocessor_3))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse5))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse6) (<= .cse6 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_prenex_2 Int) (v_DerPreprocessor_4 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse7))) (or (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (not (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| (select (store (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse8 (store (select |c_#memory_$Pointer$.offset| .cse8) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_3))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_1 Int)) (not (= (select (store (select (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_4))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))) (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse10 (select (store (select (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse11 (store (select |c_#memory_$Pointer$.offset| .cse11) (+ .cse10 8) v_DerPreprocessor_3))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_1 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse12 (select (store (select (store |c_#memory_$Pointer$.base| .cse12 (store (select |c_#memory_$Pointer$.base| .cse12) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (or (forall ((v_prenex_2 Int) (v_DerPreprocessor_4 Int)) (not (= (select (store (select (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_4))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_3 Int)) (not (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| (select (store (select (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse14 (store (select |c_#memory_$Pointer$.offset| .cse14) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_3))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|))))))))) is different from false [2021-11-20 05:54:48,479 WARN L838 $PredicateComparison]: unable to prove that (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|) (and (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse1 (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 (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|))) (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) (+ 8 .cse1) v_DerPreprocessor_3))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse1))) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_1 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) v_DerPreprocessor_4)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_1) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_3 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (let ((.cse3 (select (store (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse6 (store (select |c_#memory_$Pointer$.offset| .cse6) (+ 8 .cse4) v_DerPreprocessor_3))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_1) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (or (and (= .cse3 .cse4) (forall ((v_prenex_2 Int) (v_DerPreprocessor_4 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= .cse5 (select (store (select (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) v_DerPreprocessor_4)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_2) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| .cse3))))) (or (forall ((v_prenex_2 Int) (v_DerPreprocessor_4 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (store (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) v_DerPreprocessor_4))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_2) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_3 Int)) (not (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| (select (store (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse8 (store (select |c_#memory_$Pointer$.offset| .cse8) (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) v_DerPreprocessor_3))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_1) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) (forall ((v_prenex_2 Int) (v_DerPreprocessor_4 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= .cse9 (select (store (select (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) v_DerPreprocessor_4)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_2) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (or (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (not (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| (select (store (select (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) v_DerPreprocessor_3))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_1 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (store (select (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (store |c_#memory_$Pointer$.base| .cse11 (store (select |c_#memory_$Pointer$.base| .cse11) (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) v_DerPreprocessor_4))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_DerPreprocessor_1) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_3 Int)) (let ((.cse13 (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 (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse12 (store (select |c_#memory_$Pointer$.offset| .cse12) (+ 8 .cse13) v_DerPreprocessor_3))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_prenex_1) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse13)))))) is different from false [2021-11-20 05:54:49,762 INFO L354 Elim1Store]: treesize reduction 555, result has 50.2 percent of original size [2021-11-20 05:54:49,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 6 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 1490 treesize of output 1321 [2021-11-20 05:54:49,809 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 05:54:49,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1321 treesize of output 1309 [2021-11-20 05:54:49,923 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 05:54:49,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1309 treesize of output 1340 [2021-11-20 05:54:50,080 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 05:54:50,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1340 treesize of output 1373 [2021-11-20 05:54:50,198 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 05:54:50,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1373 treesize of output 1406 [2021-11-20 05:54:50,358 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 05:54:50,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1406 treesize of output 1439 [2021-11-20 05:54:50,555 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 05:54:50,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1439 treesize of output 1472 [2021-11-20 05:54:51,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-20 05:54:51,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 05:54:51,171 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 05:54:51,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2021-11-20 05:54:52,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-20 05:54:53,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-20 05:54:53,271 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 05:54:53,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 05:54:53,440 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 05:54:53,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1133 treesize of output 1141 [2021-11-20 05:54:54,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-20 05:54:54,495 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 05:54:54,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 631 treesize of output 627 [2021-11-20 05:54:55,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-20 05:54:55,108 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 05:54:55,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 102 [2021-11-20 05:55:00,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-20 05:55:00,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-20 05:55:00,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-20 05:55:00,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 05:55:00,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 05:55:00,269 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 05:55:00,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 168 treesize of output 178 [2021-11-20 05:55:00,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 05:55:00,510 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 05:55:00,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 121 [2021-11-20 05:55:00,519 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 05:55:00,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 121 [2021-11-20 05:55:00,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042631985] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:55:00,760 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 05:55:00,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 46 [2021-11-20 05:55:00,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404288054] [2021-11-20 05:55:00,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 05:55:00,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-20 05:55:00,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:55:00,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-20 05:55:00,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2519, Unknown=10, NotChecked=520, Total=3192 [2021-11-20 05:55:00,765 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 46 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 40 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-20 05:55:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:55:10,684 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2021-11-20 05:55:10,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-20 05:55:10,685 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 40 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2021-11-20 05:55:10,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:55:10,690 INFO L225 Difference]: With dead ends: 134 [2021-11-20 05:55:10,690 INFO L226 Difference]: Without dead ends: 132 [2021-11-20 05:55:10,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=398, Invalid=5464, Unknown=10, NotChecked=770, Total=6642 [2021-11-20 05:55:10,695 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 136 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 255 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 05:55:10,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 731 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 748 Invalid, 0 Unknown, 255 Unchecked, 0.8s Time] [2021-11-20 05:55:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-20 05:55:10,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 88. [2021-11-20 05:55:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 82 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:55:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2021-11-20 05:55:10,717 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 42 [2021-11-20 05:55:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:55:10,718 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2021-11-20 05:55:10,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 40 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-20 05:55:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2021-11-20 05:55:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-20 05:55:10,720 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:55:10,720 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:55:10,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 05:55:10,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:55:10,935 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:55:10,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:55:10,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1979380319, now seen corresponding path program 2 times [2021-11-20 05:55:10,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:55:10,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626253923] [2021-11-20 05:55:10,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:55:10,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:55:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:11,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:55:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:11,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:55:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-20 05:55:11,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:55:11,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626253923] [2021-11-20 05:55:11,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626253923] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:55:11,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:55:11,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 05:55:11,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025381801] [2021-11-20 05:55:11,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:55:11,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:55:11,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:55:11,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:55:11,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:55:11,117 INFO L87 Difference]: Start difference. First operand 88 states and 106 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) [2021-11-20 05:55:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:55:11,207 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2021-11-20 05:55:11,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 05:55:11,207 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 [2021-11-20 05:55:11,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:55:11,209 INFO L225 Difference]: With dead ends: 97 [2021-11-20 05:55:11,209 INFO L226 Difference]: Without dead ends: 89 [2021-11-20 05:55:11,209 INFO L932 BasicCegarLoop]: 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 [2021-11-20 05:55:11,210 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:55:11,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 77 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 05:55:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-20 05:55:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-11-20 05:55:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 83 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:55:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2021-11-20 05:55:11,229 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 43 [2021-11-20 05:55:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:55:11,229 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2021-11-20 05:55:11,230 INFO L471 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) [2021-11-20 05:55:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2021-11-20 05:55:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-20 05:55:11,231 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:55:11,232 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:55:11,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 05:55:11,232 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:55:11,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:55:11,233 INFO L85 PathProgramCache]: Analyzing trace with hash 497262156, now seen corresponding path program 3 times [2021-11-20 05:55:11,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:55:11,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120551424] [2021-11-20 05:55:11,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:55:11,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:55:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:11,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:55:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:11,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:55:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 05:55:11,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:55:11,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120551424] [2021-11-20 05:55:11,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120551424] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:55:11,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512240628] [2021-11-20 05:55:11,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 05:55:11,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:55:11,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:55:11,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:55:11,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 05:55:11,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-20 05:55:11,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:55:11,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 05:55:11,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:55:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 05:55:11,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:55:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 05:55:12,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512240628] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 05:55:12,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 05:55:12,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 11 [2021-11-20 05:55:12,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182388143] [2021-11-20 05:55:12,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:55:12,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:55:12,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:55:12,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:55:12,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-20 05:55:12,016 INFO L87 Difference]: Start difference. First operand 89 states and 106 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) [2021-11-20 05:55:12,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:55:12,056 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2021-11-20 05:55:12,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 05:55:12,057 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 [2021-11-20 05:55:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:55:12,058 INFO L225 Difference]: With dead ends: 106 [2021-11-20 05:55:12,059 INFO L226 Difference]: Without dead ends: 94 [2021-11-20 05:55:12,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-20 05:55:12,060 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:55:12,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 77 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:55:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-20 05:55:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2021-11-20 05:55:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 83 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:55:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2021-11-20 05:55:12,078 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 43 [2021-11-20 05:55:12,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:55:12,079 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2021-11-20 05:55:12,079 INFO L471 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) [2021-11-20 05:55:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2021-11-20 05:55:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-20 05:55:12,080 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:55:12,081 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:55:12,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 05:55:12,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-20 05:55:12,291 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:55:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:55:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1076128498, now seen corresponding path program 4 times [2021-11-20 05:55:12,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:55:12,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238996769] [2021-11-20 05:55:12,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:55:12,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:55:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:12,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:55:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:12,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:55:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 05:55:12,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:55:12,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238996769] [2021-11-20 05:55:12,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238996769] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:55:12,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:55:12,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 05:55:12,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20507544] [2021-11-20 05:55:12,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:55:12,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:55:12,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:55:12,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:55:12,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:55:12,441 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) 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) [2021-11-20 05:55:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:55:12,550 INFO L93 Difference]: Finished difference Result 111 states and 132 transitions. [2021-11-20 05:55:12,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 05:55:12,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) 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 [2021-11-20 05:55:12,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:55:12,553 INFO L225 Difference]: With dead ends: 111 [2021-11-20 05:55:12,553 INFO L226 Difference]: Without dead ends: 89 [2021-11-20 05:55:12,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-20 05:55:12,555 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:55:12,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 84 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 05:55:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-20 05:55:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-11-20 05:55:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 83 states have internal predecessors, (95), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:55:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2021-11-20 05:55:12,572 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 43 [2021-11-20 05:55:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:55:12,573 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2021-11-20 05:55:12,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) 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) [2021-11-20 05:55:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2021-11-20 05:55:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-20 05:55:12,575 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:55:12,575 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:55:12,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 05:55:12,575 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:55:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:55:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1645426363, now seen corresponding path program 1 times [2021-11-20 05:55:12,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:55:12,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359915147] [2021-11-20 05:55:12,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:55:12,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:55:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:12,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:55:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:12,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:55:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-20 05:55:12,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:55:12,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359915147] [2021-11-20 05:55:12,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359915147] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:55:12,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332931775] [2021-11-20 05:55:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:55:12,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:55:12,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:55:12,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:55:12,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 05:55:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:12,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 05:55:12,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:55:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 05:55:12,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 05:55:12,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332931775] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:55:12,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 05:55:12,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2021-11-20 05:55:12,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496946212] [2021-11-20 05:55:12,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:55:12,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:55:12,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:55:12,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:55:12,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-20 05:55:12,950 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 05:55:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:55:13,018 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2021-11-20 05:55:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 05:55:13,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2021-11-20 05:55:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:55:13,027 INFO L225 Difference]: With dead ends: 136 [2021-11-20 05:55:13,027 INFO L226 Difference]: Without dead ends: 95 [2021-11-20 05:55:13,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-11-20 05:55:13,028 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:55:13,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 84 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:55:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-20 05:55:13,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 79. [2021-11-20 05:55:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 73 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:55:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2021-11-20 05:55:13,043 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 47 [2021-11-20 05:55:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:55:13,044 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2021-11-20 05:55:13,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 05:55:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2021-11-20 05:55:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-20 05:55:13,046 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:55:13,046 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:55:13,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-20 05:55:13,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:55:13,270 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:55:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:55:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash 315770834, now seen corresponding path program 1 times [2021-11-20 05:55:13,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:55:13,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388645651] [2021-11-20 05:55:13,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:55:13,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:55:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:13,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:55:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:13,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:55:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 05:55:13,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:55:13,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388645651] [2021-11-20 05:55:13,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388645651] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:55:13,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796642066] [2021-11-20 05:55:13,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:55:13,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:55:13,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:55:13,841 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:55:13,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 05:55:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:13,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-20 05:55:13,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:55:14,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-11-20 05:55:14,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-20 05:55:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 05:55:14,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:55:14,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2021-11-20 05:55:14,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 05:55:14,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 05:55:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 05:55:15,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796642066] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:55:15,036 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:55:15,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 11] total 36 [2021-11-20 05:55:15,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107475796] [2021-11-20 05:55:15,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:55:15,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-20 05:55:15,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:55:15,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-20 05:55:15,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2021-11-20 05:55:15,039 INFO L87 Difference]: Start difference. First operand 79 states and 87 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) [2021-11-20 05:55:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:55:16,083 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2021-11-20 05:55:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 05:55:16,095 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 [2021-11-20 05:55:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:55:16,096 INFO L225 Difference]: With dead ends: 86 [2021-11-20 05:55:16,096 INFO L226 Difference]: Without dead ends: 81 [2021-11-20 05:55:16,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=352, Invalid=2000, Unknown=0, NotChecked=0, Total=2352 [2021-11-20 05:55:16,099 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 219 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 05:55:16,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 447 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 05:55:16,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-20 05:55:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2021-11-20 05:55:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 73 states have internal predecessors, (78), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:55:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2021-11-20 05:55:16,115 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 48 [2021-11-20 05:55:16,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:55:16,116 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2021-11-20 05:55:16,116 INFO L471 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) [2021-11-20 05:55:16,116 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2021-11-20 05:55:16,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-20 05:55:16,117 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:55:16,118 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:55:16,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-20 05:55:16,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-20 05:55:16,342 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:55:16,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:55:16,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1250615156, now seen corresponding path program 2 times [2021-11-20 05:55:16,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:55:16,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944863669] [2021-11-20 05:55:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:55:16,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:55:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:16,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:55:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:16,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:55:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-20 05:55:16,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:55:16,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944863669] [2021-11-20 05:55:16,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944863669] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:55:16,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060640725] [2021-11-20 05:55:16,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 05:55:16,461 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:55:16,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:55:16,466 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:55:16,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 05:55:16,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 05:55:16,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:55:16,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 05:55:16,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:55:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-20 05:55:16,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:55:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-20 05:55:17,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060640725] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:55:17,064 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:55:17,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2021-11-20 05:55:17,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836713211] [2021-11-20 05:55:17,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:55:17,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 05:55:17,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:55:17,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 05:55:17,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-20 05:55:17,068 INFO L87 Difference]: Start difference. First operand 79 states and 86 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) [2021-11-20 05:55:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:55:17,194 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2021-11-20 05:55:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 05:55:17,195 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 [2021-11-20 05:55:17,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:55:17,196 INFO L225 Difference]: With dead ends: 81 [2021-11-20 05:55:17,197 INFO L226 Difference]: Without dead ends: 51 [2021-11-20 05:55:17,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-11-20 05:55:17,198 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:55:17,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 142 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 05:55:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-11-20 05:55:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-11-20 05:55:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 45 states have internal predecessors, (47), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:55:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2021-11-20 05:55:17,208 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 49 [2021-11-20 05:55:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:55:17,208 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-11-20 05:55:17,209 INFO L471 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) [2021-11-20 05:55:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2021-11-20 05:55:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-20 05:55:17,210 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:55:17,210 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:55:17,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-20 05:55:17,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-20 05:55:17,438 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:55:17,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:55:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash -744940389, now seen corresponding path program 5 times [2021-11-20 05:55:17,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:55:17,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132530385] [2021-11-20 05:55:17,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:55:17,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:55:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:17,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:55:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:17,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:55:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:17,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 05:55:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-20 05:55:17,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:55:17,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132530385] [2021-11-20 05:55:17,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132530385] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:55:17,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797429986] [2021-11-20 05:55:17,548 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 05:55:17,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:55:17,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:55:17,551 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:55:17,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-20 05:55:17,726 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-11-20 05:55:17,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:55:17,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 05:55:17,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:55:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-20 05:55:17,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 05:55:17,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797429986] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:55:17,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 05:55:17,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-11-20 05:55:17,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406160409] [2021-11-20 05:55:17,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:55:17,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 05:55:17,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:55:17,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 05:55:17,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:55:17,846 INFO L87 Difference]: Start difference. First operand 51 states and 55 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) [2021-11-20 05:55:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:55:17,858 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2021-11-20 05:55:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 05:55:17,859 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 [2021-11-20 05:55:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:55:17,860 INFO L225 Difference]: With dead ends: 56 [2021-11-20 05:55:17,860 INFO L226 Difference]: Without dead ends: 0 [2021-11-20 05:55:17,861 INFO L932 BasicCegarLoop]: 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 [2021-11-20 05:55:17,861 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:55:17,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:55:17,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-20 05:55:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-20 05:55:17,863 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) [2021-11-20 05:55:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-20 05:55:17,863 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2021-11-20 05:55:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:55:17,864 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-20 05:55:17,864 INFO L471 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) [2021-11-20 05:55:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-20 05:55:17,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-20 05:55:17,868 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 05:55:17,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-20 05:55:18,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-20 05:55:18,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-20 05:55:21,895 INFO L854 garLoopResultBuilder]: At program point L638(lines 626 645) the Hoare annotation is: false [2021-11-20 05:55:21,895 INFO L854 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|)) [2021-11-20 05:55:21,895 INFO L858 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2021-11-20 05:55:21,895 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-20 05:55:21,896 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-20 05:55:21,896 INFO L858 garLoopResultBuilder]: For program point L631-2(lines 631 634) no Hoare annotation was computed. [2021-11-20 05:55:21,896 INFO L854 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse14 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse13 (+ (select (select |#memory_int| .cse14) 8) 1)) (.cse8 (* 2 |ULTIMATE.start_main_~len~0#1|))) (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse9 (<= (+ 2 |ULTIMATE.start_dll_circular_update_at_~index#1|) |ULTIMATE.start_main_~len~0#1|)) (.cse6 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse10 (<= .cse13 .cse8)) (.cse1 (not (= .cse14 |ULTIMATE.start_main_~s~0#1.base|))) (.cse12 (<= .cse8 .cse13)) (.cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse5 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~len~0#1| .cse6) .cse7) (let ((.cse11 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8))) (and .cse0 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse8) .cse9 .cse10 (<= .cse11 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (<= |ULTIMATE.start_main_~len~0#1| .cse11) .cse12 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) .cse2 .cse3 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse4 .cse5 .cse7)) (and .cse0 .cse9 (<= .cse6 |ULTIMATE.start_main_~len~0#1|) (< 0 .cse6) .cse10 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse7))))) [2021-11-20 05:55:21,896 INFO L858 garLoopResultBuilder]: For program point L631-4(lines 631 634) no Hoare annotation was computed. [2021-11-20 05:55:21,896 INFO L854 garLoopResultBuilder]: At program point L599(lines 585 600) the Hoare annotation is: (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (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|)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) [2021-11-20 05:55:21,897 INFO L858 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2021-11-20 05:55:21,897 INFO L858 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2021-11-20 05:55:21,897 INFO L854 garLoopResultBuilder]: At program point L617(lines 612 618) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (<= (+ 2 |ULTIMATE.start_dll_circular_update_at_~index#1|) |ULTIMATE.start_main_~len~0#1|)) (.cse2 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0)) (.cse3 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0)) (.cse4 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse7 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse8 (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|))) (.cse9 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse10 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse11 (= |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 .cse2 (= 2 |ULTIMATE.start_main_~expected~0#1|) (= 2 |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (= (select .cse3 8) .cse4) (= .cse4 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse5 .cse6 .cse7 (= .cse8 2) .cse9 .cse10 .cse11) (let ((.cse12 (* 2 |ULTIMATE.start_main_~len~0#1|)) (.cse13 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8))) (and (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|) .cse0 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse12) (<= |ULTIMATE.start_main_~expected~0#1| .cse8) .cse1 .cse2 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (<= .cse13 .cse4) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= .cse12 (+ 2 (select .cse3 (+ |ULTIMATE.start_main_~s~0#1.offset| 8)))) .cse5 .cse6 (<= .cse4 .cse13) .cse7 (<= .cse8 |ULTIMATE.start_main_~expected~0#1|) .cse9 .cse10 (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse11)))) [2021-11-20 05:55:21,897 INFO L858 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2021-11-20 05:55:21,897 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-20 05:55:21,897 INFO L858 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2021-11-20 05:55:21,897 INFO L858 garLoopResultBuilder]: For program point L635-2(lines 635 640) no Hoare annotation was computed. [2021-11-20 05:55:21,898 INFO L854 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse2 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse4 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse0 (<= (+ 2 |ULTIMATE.start_dll_circular_update_at_~index#1|) |ULTIMATE.start_main_~len~0#1|)) (.cse1 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0)) (.cse8 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse7 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse10 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse11 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse12 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3) (let ((.cse5 (* 2 |ULTIMATE.start_main_~len~0#1|)) (.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))) (and .cse4 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse5) .cse0 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (<= .cse6 .cse7) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= .cse5 (+ 2 (select .cse8 (+ |ULTIMATE.start_main_~s~0#1.offset| 8)))) .cse3 (<= .cse7 .cse6) .cse9 .cse10 .cse11 (= |ULTIMATE.start_main_~len~0#1| .cse2) .cse12)) (and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) .cse4 .cse0 .cse1 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (= (select .cse8 8) .cse7) (= .cse7 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse3 .cse9 .cse10 .cse11 .cse12))) [2021-11-20 05:55:21,898 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2021-11-20 05:55:21,898 INFO L858 garLoopResultBuilder]: For program point L635-4(lines 635 640) no Hoare annotation was computed. [2021-11-20 05:55:21,898 INFO L858 garLoopResultBuilder]: For program point L619(lines 619 625) no Hoare annotation was computed. [2021-11-20 05:55:21,898 INFO L854 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)) [2021-11-20 05:55:21,898 INFO L858 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2021-11-20 05:55:21,899 INFO L861 garLoopResultBuilder]: At program point L644(lines 626 645) the Hoare annotation is: true [2021-11-20 05:55:21,899 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-20 05:55:21,899 INFO L854 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse14 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse12 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse13 (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0)) (.cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|)) (.cse17 (select .cse6 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse18 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_dll_circular_update_at_~data#1|)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse9 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse10 (= |ULTIMATE.start_main_~len~0#1| .cse14)) (.cse11 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse0 (select .cse12 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse1 (+ |ULTIMATE.start_dll_circular_update_at_~index#1| 1)) (.cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (= .cse0 0) (<= |ULTIMATE.start_main_~len~0#1| .cse1) .cse2 (= (select .cse3 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse0) (<= .cse1 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (not (= .cse4 |ULTIMATE.start_main_~s~0#1.base|)) .cse5 (= .cse4 (select .cse6 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) .cse7 .cse8 .cse9 .cse10 .cse11)) (let ((.cse16 (* 2 |ULTIMATE.start_main_~len~0#1|)) (.cse15 (+ (select (select |#memory_int| .cse17) 8) 1))) (and .cse13 .cse2 (< 0 .cse14) (<= .cse15 .cse16) (not (= .cse17 |ULTIMATE.start_main_~s~0#1.base|)) (<= .cse16 .cse15) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) .cse5 .cse7 .cse18 .cse8 .cse9 .cse11 (= (select .cse12 |ULTIMATE.start_main_~s~0#1.offset|) 0))) (and .cse13 .cse2 (<= (+ 2 |ULTIMATE.start_dll_circular_update_at_~index#1|) |ULTIMATE.start_main_~len~0#1|) (= (select .cse3 |ULTIMATE.start_main_~s~0#1.offset|) 0) (= .cse17 |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (not .cse18) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2021-11-20 05:55:21,899 INFO L858 garLoopResultBuilder]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2021-11-20 05:55:21,900 INFO L858 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2021-11-20 05:55:21,900 INFO L861 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2021-11-20 05:55:21,900 INFO L858 garLoopResultBuilder]: For program point L604-3(lines 604 608) no Hoare annotation was computed. [2021-11-20 05:55:21,900 INFO L854 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)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (let ((.cse1 (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (and .cse0 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) .cse2 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (= (select (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0))) (and .cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) .cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) [2021-11-20 05:55:21,900 INFO L858 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2021-11-20 05:55:21,901 INFO L854 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse19 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse21 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8)) (.cse20 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse22 (* 2 |ULTIMATE.start_main_~len~0#1|))) (let ((.cse2 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse22)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse5 (<= .cse21 .cse20)) (.cse6 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse7 (= .cse22 (+ 2 (select .cse19 (+ |ULTIMATE.start_main_~s~0#1.offset| 8))))) (.cse9 (<= .cse20 .cse21)) (.cse13 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse1 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse3 (<= (+ 2 |ULTIMATE.start_dll_circular_update_at_~index#1|) |ULTIMATE.start_main_~len~0#1|)) (.cse16 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse17 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0)) (.cse10 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse15 (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|))) (.cse11 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse12 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse14 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) 8))) (and (<= 1 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| .cse0) .cse1 .cse2 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1) .cse3 (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) .cse4 .cse5 .cse6 .cse7 (<= .cse0 |ULTIMATE.start_main_~expected~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (and .cse1 .cse2 (<= |ULTIMATE.start_main_~expected~0#1| .cse15) .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 (<= .cse15 |ULTIMATE.start_main_~expected~0#1|) .cse11 .cse12 .cse13 .cse14) (let ((.cse18 (+ 2 |ULTIMATE.start_main_~i~0#1|))) (and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) .cse1 (<= |ULTIMATE.start_main_~len~0#1| .cse18) .cse3 .cse16 (<= .cse18 |ULTIMATE.start_main_~len~0#1|) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= (select .cse19 8) .cse20) (= .cse20 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse8 .cse17 .cse10 (= .cse15 2) .cse11 .cse12 .cse14))))) [2021-11-20 05:55:21,901 INFO L858 garLoopResultBuilder]: For program point L613-3(lines 613 616) no Hoare annotation was computed. [2021-11-20 05:55:21,901 INFO L858 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2021-11-20 05:55:21,901 INFO L858 garLoopResultBuilder]: For program point L577-1(lines 577 579) no Hoare annotation was computed. [2021-11-20 05:55:21,901 INFO L861 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2021-11-20 05:55:21,901 INFO L854 garLoopResultBuilder]: At program point node_createENTRY(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|)) [2021-11-20 05:55:21,901 INFO L858 garLoopResultBuilder]: For program point node_createFINAL(lines 575 584) no Hoare annotation was computed. [2021-11-20 05:55:21,902 INFO L858 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2021-11-20 05:55:21,905 INFO L732 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1] [2021-11-20 05:55:21,906 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 05:55:21,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,932 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,932 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,946 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,946 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,957 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,962 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,968 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,968 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,969 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,969 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,969 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:21,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:21,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:55:21 BoogieIcfgContainer [2021-11-20 05:55:21,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 05:55:21,981 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 05:55:21,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 05:55:21,982 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 05:55:21,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:54:00" (3/4) ... [2021-11-20 05:55:21,986 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-20 05:55:21,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2021-11-20 05:55:22,001 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-11-20 05:55:22,001 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-20 05:55:22,002 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-20 05:55:22,002 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-20 05:55:22,031 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((head == 0 && 0 == #memory_$Pointer$[\result][\result]) && !(#memory_$Pointer$[\result][\result] == \result)) && len == 2) && \result == 0) && new_head == 0 [2021-11-20 05:55:22,032 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((head == 0 && !(#memory_$Pointer$[s][s] == s)) && #memory_$Pointer$[s][s] == 0) && len == 2) && \result == 0) && new_head == 0) && len == i + 1) && s == 0) || ((((((((((((((head == 0 && 2 + data == 2 * len) && 2 + index <= len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] + 1 <= 2 * len) && unknown-#memory_int-unknown[s][8] <= len) && s == head) && len <= unknown-#memory_int-unknown[s][8]) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] + 1) && 2 + i <= len) && #memory_$Pointer$[s][s] == 0) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0)) || (((((((((((head == 0 && 2 + index <= len) && i + 1 <= len) && 0 < i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] + 1 <= 2 * len) && !(#memory_$Pointer$[s][s] == s)) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] + 1) && #memory_$Pointer$[s][s] == 0) && len == 2) && \result == 0) && new_head == 0) && s == 0) [2021-11-20 05:55:22,032 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 + index <= len && index <= 0) && i + 1 <= 0) && len == 2) || (((((((((((((head == 0 && 2 + data == 2 * len) && 2 + index <= len) && s == head) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + i) && #memory_$Pointer$[s][s] == 0) && 2 * len == 2 + unknown-#memory_int-unknown[s][s + 8]) && len == 2) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && head == s) && \result == 0) && new_head == 0) && len == i + 1) && s == 0)) || (((((((((((head == 0 && head == 0) && 2 + index <= len) && index <= 0) && 2 + i <= len) && unknown-#memory_int-unknown[s][8] == len + i) && len + i == data) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) [2021-11-20 05:55:22,032 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((#memory_$Pointer$[head][head] == 0 && len <= index + 1) && head == 0) && #memory_$Pointer$[s][head] == #memory_$Pointer$[head][head]) && index + 1 <= len) && s == head) && !(#memory_$Pointer$[head][head] == s)) && len + i == data) && #memory_$Pointer$[head][head] == #memory_$Pointer$[s][head]) && len == 2) && \result == 0) && new_head == 0) && len == i + 1) && s == 0) || ((((((((((((((head == 0 && head == 0) && 0 < i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] + 1 <= 2 * len) && !(#memory_$Pointer$[s][s] == s)) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] + 1) && 2 + i <= len) && index <= 0) && len + i == data) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) && #memory_$Pointer$[head][s] == 0)) || (((((((((((head == 0 && head == 0) && 2 + index <= len) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && !(head == s)) && len + i == data) && len == 2) && \result == 0) && new_head == 0) && len == i + 1) && s == 0) [2021-11-20 05:55:22,033 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 <= index && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][8]) && head == 0) && 2 + data == 2 * len) && index <= 1) && 2 + index <= len) && 0 == #memory_$Pointer$[head][head]) && s == head) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + i) && #memory_$Pointer$[s][s] == 0) && 2 * len == 2 + unknown-#memory_int-unknown[s][s + 8]) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][8] <= expected) && len == 2) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && head == s) && \result == 0) && new_head == 0) && len == i + 1) && s == 0) || (((((((((((((((((head == 0 && 2 + data == 2 * len) && expected <= unknown-#memory_int-unknown[head][8 + head]) && 2 + index <= len) && index <= 0) && s == head) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + i) && #memory_$Pointer$[s][s] == 0) && 2 * len == 2 + unknown-#memory_int-unknown[s][s + 8]) && len == 2) && head == 0) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && head == s) && unknown-#memory_int-unknown[head][8 + head] <= expected) && \result == 0) && new_head == 0) && len == i + 1) && s == 0)) || (((((((((((((((head == 0 && head == 0) && len <= 2 + i) && 2 + index <= len) && index <= 0) && 2 + i <= len) && 2 == expected) && unknown-#memory_int-unknown[s][8] == len + i) && len + i == data) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[head][8 + head] == 2) && \result == 0) && new_head == 0) && s == 0) [2021-11-20 05:55:22,033 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((head == 0 && head == 0) && i == 0) && 2 + index <= len) && index <= 0) && 2 == expected) && 2 == \result) && unknown-#memory_int-unknown[s][8] == len + i) && len + i == data) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[head][8 + head] == 2) && \result == 0) && new_head == 0) && s == 0) || (((((((((((((((((((expected <= \result && head == 0) && 2 + data == 2 * len) && expected <= unknown-#memory_int-unknown[head][8 + head]) && 2 + index <= len) && index <= 0) && s == head) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + i) && #memory_$Pointer$[s][s] == 0) && 2 * len == 2 + unknown-#memory_int-unknown[s][s + 8]) && len == 2) && head == 0) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && head == s) && unknown-#memory_int-unknown[head][8 + head] <= expected) && \result == 0) && new_head == 0) && \result <= expected) && len == i + 1) && s == 0) [2021-11-20 05:55:22,052 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 05:55:22,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 05:55:22,053 INFO L158 Benchmark]: Toolchain (without parser) took 83199.70ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 68.3MB in the beginning and 51.0MB in the end (delta: 17.3MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. [2021-11-20 05:55:22,054 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 100.7MB. Free memory was 55.7MB in the beginning and 55.6MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 05:55:22,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 659.03ms. Allocated memory is still 100.7MB. Free memory was 68.3MB in the beginning and 69.7MB in the end (delta: -1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 05:55:22,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.66ms. Allocated memory is still 100.7MB. Free memory was 69.7MB in the beginning and 67.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 05:55:22,055 INFO L158 Benchmark]: Boogie Preprocessor took 43.91ms. Allocated memory is still 100.7MB. Free memory was 67.6MB in the beginning and 66.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 05:55:22,055 INFO L158 Benchmark]: RCFGBuilder took 628.13ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 52.1MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-20 05:55:22,056 INFO L158 Benchmark]: TraceAbstraction took 81683.75ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 51.3MB in the beginning and 54.2MB in the end (delta: -2.9MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2021-11-20 05:55:22,056 INFO L158 Benchmark]: Witness Printer took 71.22ms. Allocated memory is still 146.8MB. Free memory was 54.2MB in the beginning and 51.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-20 05:55:22,059 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.37ms. Allocated memory is still 100.7MB. Free memory was 55.7MB in the beginning and 55.6MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 659.03ms. Allocated memory is still 100.7MB. Free memory was 68.3MB in the beginning and 69.7MB in the end (delta: -1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.66ms. Allocated memory is still 100.7MB. Free memory was 69.7MB in the beginning and 67.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.91ms. Allocated memory is still 100.7MB. Free memory was 67.6MB in the beginning and 66.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 628.13ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 52.1MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 81683.75ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 51.3MB in the beginning and 54.2MB in the end (delta: -2.9MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. * Witness Printer took 71.22ms. Allocated memory is still 146.8MB. Free memory was 54.2MB in the beginning and 51.0MB in the end (delta: 3.1MB). 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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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 * 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: 81.5s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 724 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 723 mSDsluCounter, 2207 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 255 IncrementalHoareTripleChecker+Unchecked, 1794 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1732 IncrementalHoareTripleChecker+Invalid, 2149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 413 mSDtfsCounter, 1732 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 721 GetRequests, 513 SyntacticMatches, 8 SemanticMatches, 200 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1553 ImplicationChecksByTransitivity, 49.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=8, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 111 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 20 PreInvPairs, 43 NumberOfFragments, 1195 HoareAnnotationTreeSize, 20 FomulaSimplifications, 5392 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 3504 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 61.3s InterpolantComputationTime, 866 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1017 ConstructedInterpolants, 8 QuantifiedInterpolants, 6419 SizeOfPredicates, 69 NumberOfNonLiveVariables, 1801 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 360/439 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: 626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 585]: Loop Invariant [2021-11-20 05:55:22,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,084 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((head == 0 && 0 == #memory_$Pointer$[\result][\result]) && !(#memory_$Pointer$[\result][\result] == \result)) && len == 2) && \result == 0) && new_head == 0 - InvariantResult [Line: 620]: Loop Invariant [2021-11-20 05:55:22,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,094 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,095 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,095 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,095 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,095 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,096 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,096 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,097 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,097 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,101 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,107 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((#memory_$Pointer$[head][head] == 0 && len <= index + 1) && head == 0) && #memory_$Pointer$[s][head] == #memory_$Pointer$[head][head]) && index + 1 <= len) && s == head) && !(#memory_$Pointer$[head][head] == s)) && len + i == data) && #memory_$Pointer$[head][head] == #memory_$Pointer$[s][head]) && len == 2) && \result == 0) && new_head == 0) && len == i + 1) && s == 0) || ((((((((((((((head == 0 && head == 0) && 0 < i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] + 1 <= 2 * len) && !(#memory_$Pointer$[s][s] == s)) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] + 1) && 2 + i <= len) && index <= 0) && len + i == data) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) && #memory_$Pointer$[head][s] == 0)) || (((((((((((head == 0 && head == 0) && 2 + index <= len) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && !(head == s)) && len + i == data) && len == 2) && \result == 0) && new_head == 0) && len == i + 1) && s == 0) - InvariantResult [Line: 635]: Loop Invariant [2021-11-20 05:55:22,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((2 + index <= len && index <= 0) && i + 1 <= 0) && len == 2) || (((((((((((((head == 0 && 2 + data == 2 * len) && 2 + index <= len) && s == head) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + i) && #memory_$Pointer$[s][s] == 0) && 2 * len == 2 + unknown-#memory_int-unknown[s][s + 8]) && len == 2) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && head == s) && \result == 0) && new_head == 0) && len == i + 1) && s == 0)) || (((((((((((head == 0 && head == 0) && 2 + index <= len) && index <= 0) && 2 + i <= len) && unknown-#memory_int-unknown[s][8] == len + i) && len + i == data) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 631]: Loop Invariant [2021-11-20 05:55:22,122 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,124 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,124 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,124 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,125 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,129 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,129 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,129 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((head == 0 && !(#memory_$Pointer$[s][s] == s)) && #memory_$Pointer$[s][s] == 0) && len == 2) && \result == 0) && new_head == 0) && len == i + 1) && s == 0) || ((((((((((((((head == 0 && 2 + data == 2 * len) && 2 + index <= len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] + 1 <= 2 * len) && unknown-#memory_int-unknown[s][8] <= len) && s == head) && len <= unknown-#memory_int-unknown[s][8]) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] + 1) && 2 + i <= len) && #memory_$Pointer$[s][s] == 0) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0)) || (((((((((((head == 0 && 2 + index <= len) && i + 1 <= len) && 0 < i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] + 1 <= 2 * len) && !(#memory_$Pointer$[s][s] == s)) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] + 1) && #memory_$Pointer$[s][s] == 0) && len == 2) && \result == 0) && new_head == 0) && s == 0) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 612]: Loop Invariant [2021-11-20 05:55:22,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((head == 0 && head == 0) && i == 0) && 2 + index <= len) && index <= 0) && 2 == expected) && 2 == \result) && unknown-#memory_int-unknown[s][8] == len + i) && len + i == data) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[head][8 + head] == 2) && \result == 0) && new_head == 0) && s == 0) || (((((((((((((((((((expected <= \result && head == 0) && 2 + data == 2 * len) && expected <= unknown-#memory_int-unknown[head][8 + head]) && 2 + index <= len) && index <= 0) && s == head) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + i) && #memory_$Pointer$[s][s] == 0) && 2 * len == 2 + unknown-#memory_int-unknown[s][s + 8]) && len == 2) && head == 0) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && head == s) && unknown-#memory_int-unknown[head][8 + head] <= expected) && \result == 0) && new_head == 0) && \result <= expected) && len == i + 1) && s == 0) - InvariantResult [Line: 588]: Loop Invariant [2021-11-20 05:55:22,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((head == 0 && !(head == #memory_$Pointer$[last := #memory_$Pointer$[last][last := head]][head][head + 4 := last][head])) && len == 2) && new_head == 0) && len <= 1) && #memory_$Pointer$[last := #memory_$Pointer$[last][last := head]][head][head + 4 := last][head] == 0) || ((((head == 0 && \valid[head] == 1) && 2 == len) && len == 2) && head == last) - InvariantResult [Line: 613]: Loop Invariant [2021-11-20 05:55:22,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,156 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,156 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,157 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,157 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,157 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 05:55:22,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 05:55:22,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((1 <= index && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][8]) && head == 0) && 2 + data == 2 * len) && index <= 1) && 2 + index <= len) && 0 == #memory_$Pointer$[head][head]) && s == head) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + i) && #memory_$Pointer$[s][s] == 0) && 2 * len == 2 + unknown-#memory_int-unknown[s][s + 8]) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][8] <= expected) && len == 2) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && head == s) && \result == 0) && new_head == 0) && len == i + 1) && s == 0) || (((((((((((((((((head == 0 && 2 + data == 2 * len) && expected <= unknown-#memory_int-unknown[head][8 + head]) && 2 + index <= len) && index <= 0) && s == head) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + i) && #memory_$Pointer$[s][s] == 0) && 2 * len == 2 + unknown-#memory_int-unknown[s][s + 8]) && len == 2) && head == 0) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && head == s) && unknown-#memory_int-unknown[head][8 + head] <= expected) && \result == 0) && new_head == 0) && len == i + 1) && s == 0)) || (((((((((((((((head == 0 && head == 0) && len <= 2 + i) && 2 + index <= len) && index <= 0) && 2 + i <= len) && 2 == expected) && unknown-#memory_int-unknown[s][8] == len + i) && len + i == data) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[head][8 + head] == 2) && \result == 0) && new_head == 0) && s == 0) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-11-20 05:55:22,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d257d418-f9ce-4434-b3fd-d79727d66e15/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE