./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 09:04:49,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 09:04:49,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 09:04:49,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 09:04:49,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 09:04:49,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 09:04:49,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 09:04:49,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 09:04:49,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 09:04:49,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 09:04:49,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 09:04:49,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 09:04:49,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 09:04:49,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 09:04:49,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 09:04:49,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 09:04:49,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 09:04:49,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 09:04:49,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 09:04:49,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 09:04:49,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 09:04:49,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 09:04:49,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 09:04:49,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 09:04:49,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 09:04:49,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 09:04:49,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 09:04:49,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 09:04:49,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 09:04:49,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 09:04:49,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 09:04:49,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 09:04:49,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 09:04:49,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 09:04:49,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 09:04:49,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 09:04:49,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 09:04:49,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 09:04:49,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 09:04:49,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 09:04:49,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 09:04:49,436 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 09:04:49,468 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 09:04:49,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 09:04:49,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 09:04:49,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 09:04:49,470 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 09:04:49,470 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 09:04:49,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 09:04:49,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 09:04:49,471 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 09:04:49,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 09:04:49,472 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 09:04:49,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 09:04:49,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 09:04:49,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 09:04:49,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 09:04:49,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 09:04:49,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 09:04:49,473 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 09:04:49,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 09:04:49,474 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 09:04:49,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 09:04:49,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 09:04:49,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 09:04:49,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 09:04:49,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:04:49,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 09:04:49,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 09:04:49,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 09:04:49,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 09:04:49,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 09:04:49,476 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 09:04:49,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 09:04:49,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 09:04:49,477 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 09:04:49,477 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2021-12-17 09:04:49,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 09:04:49,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 09:04:49,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 09:04:49,764 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 09:04:49,764 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 09:04:49,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-17 09:04:49,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02adbbaf6/2d2e179eabee45a18663dd7abfbe8853/FLAGabfa9c426 [2021-12-17 09:04:50,432 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 09:04:50,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-17 09:04:50,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02adbbaf6/2d2e179eabee45a18663dd7abfbe8853/FLAGabfa9c426 [2021-12-17 09:04:50,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02adbbaf6/2d2e179eabee45a18663dd7abfbe8853 [2021-12-17 09:04:50,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 09:04:50,720 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 09:04:50,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 09:04:50,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 09:04:50,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 09:04:50,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:04:50" (1/1) ... [2021-12-17 09:04:50,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6cd2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:50, skipping insertion in model container [2021-12-17 09:04:50,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:04:50" (1/1) ... [2021-12-17 09:04:50,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 09:04:50,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 09:04:51,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-12-17 09:04:51,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:04:51,108 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 09:04:51,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-12-17 09:04:51,138 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:04:51,161 INFO L208 MainTranslator]: Completed translation [2021-12-17 09:04:51,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:51 WrapperNode [2021-12-17 09:04:51,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 09:04:51,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 09:04:51,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 09:04:51,163 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 09:04:51,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:51" (1/1) ... [2021-12-17 09:04:51,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:51" (1/1) ... [2021-12-17 09:04:51,223 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2021-12-17 09:04:51,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 09:04:51,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 09:04:51,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 09:04:51,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 09:04:51,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:51" (1/1) ... [2021-12-17 09:04:51,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:51" (1/1) ... [2021-12-17 09:04:51,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:51" (1/1) ... [2021-12-17 09:04:51,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:51" (1/1) ... [2021-12-17 09:04:51,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:51" (1/1) ... [2021-12-17 09:04:51,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:51" (1/1) ... [2021-12-17 09:04:51,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:51" (1/1) ... [2021-12-17 09:04:51,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 09:04:51,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 09:04:51,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 09:04:51,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 09:04:51,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:51" (1/1) ... [2021-12-17 09:04:51,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:04:51,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:04:51,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 09:04:51,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 09:04:51,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 09:04:51,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 09:04:51,336 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-17 09:04:51,336 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-17 09:04:51,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 09:04:51,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 09:04:51,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 09:04:51,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 09:04:51,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 09:04:51,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 09:04:51,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 09:04:51,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 09:04:51,416 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 09:04:51,417 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 09:04:51,592 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 09:04:51,597 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 09:04:51,597 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-17 09:04:51,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:04:51 BoogieIcfgContainer [2021-12-17 09:04:51,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 09:04:51,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 09:04:51,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 09:04:51,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 09:04:51,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:04:50" (1/3) ... [2021-12-17 09:04:51,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f84af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:04:51, skipping insertion in model container [2021-12-17 09:04:51,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:51" (2/3) ... [2021-12-17 09:04:51,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f84af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:04:51, skipping insertion in model container [2021-12-17 09:04:51,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:04:51" (3/3) ... [2021-12-17 09:04:51,606 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2021-12-17 09:04:51,610 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 09:04:51,610 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 09:04:51,656 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 09:04:51,663 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-12-17 09:04:51,663 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 09:04:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:04:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-17 09:04:51,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:04:51,686 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-12-17 09:04:51,687 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:04:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:04:51,691 INFO L85 PathProgramCache]: Analyzing trace with hash 663980757, now seen corresponding path program 1 times [2021-12-17 09:04:51,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:04:51,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178298618] [2021-12-17 09:04:51,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:04:51,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:04:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:51,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 09:04:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:04:51,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:04:51,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178298618] [2021-12-17 09:04:51,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178298618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:04:51,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:04:51,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 09:04:51,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787664] [2021-12-17 09:04:51,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:04:51,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 09:04:51,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:04:51,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 09:04:51,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:04:51,990 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 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-12-17 09:04:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:04:52,046 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2021-12-17 09:04:52,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 09:04:52,048 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-12-17 09:04:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:04:52,057 INFO L225 Difference]: With dead ends: 61 [2021-12-17 09:04:52,058 INFO L226 Difference]: Without dead ends: 28 [2021-12-17 09:04:52,061 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-12-17 09:04:52,065 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:04:52,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:04:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-17 09:04:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-17 09:04:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:04:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-12-17 09:04:52,098 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20 [2021-12-17 09:04:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:04:52,099 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-17 09:04:52,099 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-12-17 09:04:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-12-17 09:04:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-17 09:04:52,101 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:04:52,101 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-12-17 09:04:52,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 09:04:52,102 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:04:52,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:04:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash 616475652, now seen corresponding path program 1 times [2021-12-17 09:04:52,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:04:52,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146656389] [2021-12-17 09:04:52,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:04:52,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:04:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 09:04:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:04:52,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:04:52,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146656389] [2021-12-17 09:04:52,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146656389] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:04:52,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:04:52,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 09:04:52,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726770966] [2021-12-17 09:04:52,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:04:52,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 09:04:52,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:04:52,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 09:04:52,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 09:04:52,256 INFO L87 Difference]: Start difference. First operand 28 states and 33 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-12-17 09:04:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:04:52,291 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2021-12-17 09:04:52,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 09:04:52,291 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-12-17 09:04:52,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:04:52,293 INFO L225 Difference]: With dead ends: 47 [2021-12-17 09:04:52,293 INFO L226 Difference]: Without dead ends: 31 [2021-12-17 09:04:52,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 09:04:52,298 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:04:52,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:04:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-17 09:04:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-12-17 09:04:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:04:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2021-12-17 09:04:52,313 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20 [2021-12-17 09:04:52,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:04:52,315 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2021-12-17 09:04:52,315 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-12-17 09:04:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2021-12-17 09:04:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 09:04:52,321 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:04:52,321 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] [2021-12-17 09:04:52,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 09:04:52,321 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:04:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:04:52,322 INFO L85 PathProgramCache]: Analyzing trace with hash -600691076, now seen corresponding path program 1 times [2021-12-17 09:04:52,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:04:52,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072674451] [2021-12-17 09:04:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:04:52,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:04:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:52,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 09:04:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:52,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 09:04:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:04:52,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:04:52,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072674451] [2021-12-17 09:04:52,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072674451] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:04:52,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569123192] [2021-12-17 09:04:52,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:04:52,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:04:52,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:04:52,492 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:04:52,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 09:04:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:52,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 09:04:52,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:04:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 09:04:52,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 09:04:52,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569123192] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:04:52,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 09:04:52,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2021-12-17 09:04:52,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333102954] [2021-12-17 09:04:52,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:04:52,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 09:04:52,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:04:52,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 09:04:52,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 09:04:52,688 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 09:04:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:04:52,711 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2021-12-17 09:04:52,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 09:04:52,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 28 [2021-12-17 09:04:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:04:52,713 INFO L225 Difference]: With dead ends: 51 [2021-12-17 09:04:52,713 INFO L226 Difference]: Without dead ends: 42 [2021-12-17 09:04:52,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 09:04:52,714 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 44 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:04:52,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 51 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:04:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-17 09:04:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2021-12-17 09:04:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:04:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-17 09:04:52,720 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 28 [2021-12-17 09:04:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:04:52,720 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-17 09:04:52,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 09:04:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-17 09:04:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-17 09:04:52,721 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:04:52,721 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] [2021-12-17 09:04:52,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 09:04:52,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:04:52,936 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:04:52,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:04:52,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1948852891, now seen corresponding path program 1 times [2021-12-17 09:04:52,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:04:52,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222039988] [2021-12-17 09:04:52,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:04:52,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:04:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:53,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 09:04:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:53,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 09:04:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:04:53,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:04:53,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222039988] [2021-12-17 09:04:53,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222039988] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:04:53,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745811343] [2021-12-17 09:04:53,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:04:53,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:04:53,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:04:53,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:04:53,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 09:04:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:53,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 09:04:53,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:04:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 09:04:53,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:04:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 09:04:53,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745811343] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:04:53,372 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:04:53,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2021-12-17 09:04:53,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181107535] [2021-12-17 09:04:53,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:04:53,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 09:04:53,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:04:53,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 09:04:53,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-17 09:04:53,378 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 09:04:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:04:53,489 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2021-12-17 09:04:53,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 09:04:53,489 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 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 33 [2021-12-17 09:04:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:04:53,492 INFO L225 Difference]: With dead ends: 66 [2021-12-17 09:04:53,492 INFO L226 Difference]: Without dead ends: 57 [2021-12-17 09:04:53,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:04:53,495 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 69 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:04:53,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 152 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:04:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-17 09:04:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2021-12-17 09:04:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:04:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2021-12-17 09:04:53,512 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 33 [2021-12-17 09:04:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:04:53,516 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2021-12-17 09:04:53,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 09:04:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-12-17 09:04:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 09:04:53,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:04:53,518 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] [2021-12-17 09:04:53,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 09:04:53,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-17 09:04:53,740 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:04:53,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:04:53,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2072516636, now seen corresponding path program 2 times [2021-12-17 09:04:53,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:04:53,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031419528] [2021-12-17 09:04:53,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:04:53,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:04:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:53,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 09:04:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:53,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 09:04:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 09:04:53,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:04:53,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031419528] [2021-12-17 09:04:53,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031419528] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:04:53,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828064323] [2021-12-17 09:04:53,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:04:53,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:04:53,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:04:53,831 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:04:53,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 09:04:53,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:04:53,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:04:53,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 09:04:53,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:04:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 09:04:54,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:04:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 09:04:54,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828064323] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:04:54,120 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:04:54,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2021-12-17 09:04:54,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262883676] [2021-12-17 09:04:54,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:04:54,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 09:04:54,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:04:54,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 09:04:54,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:04:54,122 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 09:04:54,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:04:54,282 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2021-12-17 09:04:54,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 09:04:54,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 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 38 [2021-12-17 09:04:54,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:04:54,284 INFO L225 Difference]: With dead ends: 61 [2021-12-17 09:04:54,284 INFO L226 Difference]: Without dead ends: 47 [2021-12-17 09:04:54,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-12-17 09:04:54,285 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 76 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:04:54,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 210 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:04:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-17 09:04:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2021-12-17 09:04:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:04:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2021-12-17 09:04:54,289 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 38 [2021-12-17 09:04:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:04:54,289 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2021-12-17 09:04:54,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 09:04:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2021-12-17 09:04:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-17 09:04:54,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:04:54,290 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] [2021-12-17 09:04:54,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 09:04:54,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:04:54,511 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:04:54,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:04:54,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1973765418, now seen corresponding path program 1 times [2021-12-17 09:04:54,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:04:54,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068905466] [2021-12-17 09:04:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:04:54,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:04:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:54,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 09:04:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:55,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 09:04:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:04:55,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:04:55,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068905466] [2021-12-17 09:04:55,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068905466] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:04:55,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000989387] [2021-12-17 09:04:55,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:04:55,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:04:55,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:04:55,101 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:04:55,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 09:04:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:55,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 98 conjunts are in the unsatisfiable core [2021-12-17 09:04:55,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:04:55,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:04:55,486 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 09:04:55,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-17 09:04:55,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:04:55,618 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 09:04:55,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-17 09:04:55,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:04:55,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-17 09:04:55,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:04:55,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-17 09:04:56,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 09:04:56,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-17 09:04:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:04:56,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:04:56,462 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_513 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-17 09:04:56,481 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_513 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_513) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_513) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-17 09:04:56,492 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_513 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_513) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_513) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-17 09:04:56,518 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:04:56,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-17 09:04:56,526 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:04:56,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 67 [2021-12-17 09:04:56,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-17 09:04:56,636 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:04:56,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-17 09:04:56,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:04:56,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2021-12-17 09:04:56,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-17 09:04:56,826 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int)) (v_ArrVal_509 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_509) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-17 09:04:56,836 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:04:56,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-17 09:04:56,839 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 43 treesize of output 39 [2021-12-17 09:04:56,841 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 52 treesize of output 48 [2021-12-17 09:04:56,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-17 09:04:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-17 09:04:57,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000989387] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:04:57,329 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:04:57,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 57 [2021-12-17 09:04:57,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018024231] [2021-12-17 09:04:57,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:04:57,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-12-17 09:04:57,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:04:57,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-12-17 09:04:57,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2577, Unknown=4, NotChecked=420, Total=3192 [2021-12-17 09:04:57,332 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-17 09:04:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:04:58,320 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2021-12-17 09:04:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 09:04:58,320 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2021-12-17 09:04:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:04:58,322 INFO L225 Difference]: With dead ends: 91 [2021-12-17 09:04:58,323 INFO L226 Difference]: Without dead ends: 89 [2021-12-17 09:04:58,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=340, Invalid=3832, Unknown=4, NotChecked=516, Total=4692 [2021-12-17 09:04:58,325 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 102 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:04:58,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 558 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 566 Invalid, 0 Unknown, 333 Unchecked, 0.4s Time] [2021-12-17 09:04:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-17 09:04:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 64. [2021-12-17 09:04:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 09:04:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2021-12-17 09:04:58,333 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 39 [2021-12-17 09:04:58,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:04:58,334 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2021-12-17 09:04:58,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-17 09:04:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2021-12-17 09:04:58,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 09:04:58,335 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:04:58,335 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] [2021-12-17 09:04:58,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-17 09:04:58,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:04:58,551 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:04:58,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:04:58,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1005531927, now seen corresponding path program 1 times [2021-12-17 09:04:58,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:04:58,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751930106] [2021-12-17 09:04:58,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:04:58,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:04:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:58,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 09:04:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:58,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 09:04:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 09:04:58,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:04:58,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751930106] [2021-12-17 09:04:58,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751930106] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:04:58,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:04:58,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 09:04:58,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356715670] [2021-12-17 09:04:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:04:58,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 09:04:58,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:04:58,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 09:04:58,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 09:04:58,684 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 09:04:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:04:58,735 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2021-12-17 09:04:58,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 09:04:58,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2021-12-17 09:04:58,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:04:58,737 INFO L225 Difference]: With dead ends: 81 [2021-12-17 09:04:58,737 INFO L226 Difference]: Without dead ends: 73 [2021-12-17 09:04:58,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 09:04:58,738 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:04:58,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:04:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-17 09:04:58,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2021-12-17 09:04:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 60 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 09:04:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2021-12-17 09:04:58,778 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 40 [2021-12-17 09:04:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:04:58,781 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2021-12-17 09:04:58,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 09:04:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2021-12-17 09:04:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 09:04:58,783 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:04:58,783 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] [2021-12-17 09:04:58,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 09:04:58,783 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:04:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:04:58,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1440509788, now seen corresponding path program 2 times [2021-12-17 09:04:58,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:04:58,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569557314] [2021-12-17 09:04:58,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:04:58,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:04:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:58,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 09:04:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:58,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 09:04:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 09:04:58,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:04:58,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569557314] [2021-12-17 09:04:58,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569557314] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:04:58,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829864474] [2021-12-17 09:04:58,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:04:58,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:04:58,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:04:58,849 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:04:58,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 09:04:58,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:04:58,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:04:58,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 09:04:58,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:04:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 09:04:59,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:04:59,139 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 09:04:59,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829864474] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:04:59,139 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:04:59,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2021-12-17 09:04:59,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169854638] [2021-12-17 09:04:59,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:04:59,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 09:04:59,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:04:59,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 09:04:59,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-17 09:04:59,141 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 09:04:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:04:59,208 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2021-12-17 09:04:59,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 09:04:59,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2021-12-17 09:04:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:04:59,209 INFO L225 Difference]: With dead ends: 107 [2021-12-17 09:04:59,209 INFO L226 Difference]: Without dead ends: 85 [2021-12-17 09:04:59,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:04:59,210 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:04:59,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 110 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:04:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-17 09:04:59,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2021-12-17 09:04:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 09:04:59,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2021-12-17 09:04:59,218 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 40 [2021-12-17 09:04:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:04:59,218 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2021-12-17 09:04:59,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 09:04:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2021-12-17 09:04:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-17 09:04:59,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:04:59,220 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] [2021-12-17 09:04:59,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 09:04:59,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:04:59,420 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:04:59,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:04:59,421 INFO L85 PathProgramCache]: Analyzing trace with hash 896238913, now seen corresponding path program 1 times [2021-12-17 09:04:59,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:04:59,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172562885] [2021-12-17 09:04:59,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:04:59,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:04:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:59,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 09:04:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:59,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 09:04:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 09:04:59,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:04:59,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172562885] [2021-12-17 09:04:59,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172562885] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:04:59,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531991096] [2021-12-17 09:04:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:04:59,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:04:59,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:04:59,647 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:04:59,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 09:04:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:04:59,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 09:04:59,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:04:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 09:04:59,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:04:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 09:04:59,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531991096] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:04:59,963 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:04:59,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-12-17 09:04:59,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505062325] [2021-12-17 09:04:59,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:04:59,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 09:04:59,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:04:59,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 09:04:59,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 09:04:59,964 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 09:05:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:05:00,014 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2021-12-17 09:05:00,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 09:05:00,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-17 09:05:00,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:05:00,015 INFO L225 Difference]: With dead ends: 83 [2021-12-17 09:05:00,016 INFO L226 Difference]: Without dead ends: 75 [2021-12-17 09:05:00,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-17 09:05:00,017 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:05:00,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 124 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:05:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-17 09:05:00,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2021-12-17 09:05:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 09:05:00,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2021-12-17 09:05:00,024 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 45 [2021-12-17 09:05:00,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:05:00,024 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2021-12-17 09:05:00,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 09:05:00,025 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2021-12-17 09:05:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-17 09:05:00,026 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:05:00,026 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:05:00,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-17 09:05:00,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:05:00,248 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:05:00,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:05:00,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1969553287, now seen corresponding path program 3 times [2021-12-17 09:05:00,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:05:00,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897843617] [2021-12-17 09:05:00,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:05:00,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:05:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:05:00,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 09:05:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:05:00,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 09:05:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:05:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 09:05:00,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:05:00,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897843617] [2021-12-17 09:05:00,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897843617] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:05:00,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298765361] [2021-12-17 09:05:00,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 09:05:00,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:05:00,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:05:00,340 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:05:00,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 09:05:00,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 09:05:00,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:05:00,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 09:05:00,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:05:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 09:05:00,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 09:05:00,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298765361] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:05:00,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 09:05:00,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2021-12-17 09:05:00,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225462392] [2021-12-17 09:05:00,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:05:00,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 09:05:00,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:05:00,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 09:05:00,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:05:00,783 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 09:05:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:05:00,828 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2021-12-17 09:05:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 09:05:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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 45 [2021-12-17 09:05:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:05:00,830 INFO L225 Difference]: With dead ends: 92 [2021-12-17 09:05:00,830 INFO L226 Difference]: Without dead ends: 72 [2021-12-17 09:05:00,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:05:00,831 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:05:00,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 81 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:05:00,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-17 09:05:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2021-12-17 09:05:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 09:05:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2021-12-17 09:05:00,844 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 45 [2021-12-17 09:05:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:05:00,845 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2021-12-17 09:05:00,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 09:05:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2021-12-17 09:05:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-17 09:05:00,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:05:00,849 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] [2021-12-17 09:05:00,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 09:05:01,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:05:01,064 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:05:01,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:05:01,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2065256414, now seen corresponding path program 1 times [2021-12-17 09:05:01,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:05:01,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366031364] [2021-12-17 09:05:01,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:05:01,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:05:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:05:01,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 09:05:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:05:01,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 09:05:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:05:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:05:01,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:05:01,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366031364] [2021-12-17 09:05:01,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366031364] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:05:01,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415424671] [2021-12-17 09:05:01,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:05:01,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:05:01,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:05:01,740 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:05:01,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 09:05:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:05:01,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 106 conjunts are in the unsatisfiable core [2021-12-17 09:05:01,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:05:01,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:05:02,096 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 09:05:02,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-17 09:05:02,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:05:02,205 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 09:05:02,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-17 09:05:02,352 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 6 treesize of output 5 [2021-12-17 09:05:02,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:05:02,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-17 09:05:02,757 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 09:05:02,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2021-12-17 09:05:02,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-17 09:05:02,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-17 09:05:03,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-12-17 09:05:03,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-17 09:05:03,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-17 09:05:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:05:03,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:05:03,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2021-12-17 09:05:03,779 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ |c_ULTIMATE.start_main_~len~0#1| 1) |c_ULTIMATE.start_sll_circular_update_at_~data#1|) (forall ((v_ArrVal_1087 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1087) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (forall ((v_ArrVal_1088 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|))) is different from false [2021-12-17 09:05:03,805 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ |c_ULTIMATE.start_main_~len~0#1| 1) |c_ULTIMATE.start_sll_circular_update_at_~data#1|) (forall ((v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) (forall ((v_ArrVal_1087 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1087) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)))) is different from false [2021-12-17 09:05:03,817 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1087 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1087) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)))) is different from false [2021-12-17 09:05:03,826 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1087 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1087) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)))) is different from false [2021-12-17 09:05:03,843 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 230 treesize of output 214 [2021-12-17 09:05:03,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 170 [2021-12-17 09:05:03,855 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 170 treesize of output 162 [2021-12-17 09:05:03,960 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_1084)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (and (or .cse0 (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (forall ((v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_1084)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store .cse1 .cse2 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse2)))) .cse0 (= 0 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2021-12-17 09:05:03,971 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_1084)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1)))) (forall ((v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_1084)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2021-12-17 09:05:06,024 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-17 09:05:08,054 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) .cse1 v_ArrVal_1088) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse1))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2021-12-17 09:05:08,088 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1082))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) .cse2 v_ArrVal_1088) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse2)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2021-12-17 09:05:08,127 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:05:08,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 76 [2021-12-17 09:05:08,131 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 129 treesize of output 119 [2021-12-17 09:05:08,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:05:08,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2021-12-17 09:05:08,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:05:08,141 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 59 treesize of output 55 [2021-12-17 09:05:08,144 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 55 treesize of output 51 [2021-12-17 09:05:08,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:05:08,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2021-12-17 09:05:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-17 09:05:08,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415424671] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:05:08,544 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:05:08,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 26] total 65 [2021-12-17 09:05:08,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312102383] [2021-12-17 09:05:08,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:05:08,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2021-12-17 09:05:08,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:05:08,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-12-17 09:05:08,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2935, Unknown=9, NotChecked=1044, Total=4160 [2021-12-17 09:05:08,548 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 65 states, 64 states have (on average 1.75) internal successors, (112), 56 states have internal predecessors, (112), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-17 09:05:10,803 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| 2) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1082))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2) .cse3 v_ArrVal_1088) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse3)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-17 09:05:12,806 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) .cse1 v_ArrVal_1088) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse1))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |c_ULTIMATE.start_main_~len~0#1| 2) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) is different from false [2021-12-17 09:05:14,811 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~len~0#1| 2) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2021-12-17 09:05:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:05:15,802 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2021-12-17 09:05:15,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-17 09:05:15,802 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.75) internal successors, (112), 56 states have internal predecessors, (112), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2021-12-17 09:05:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:05:15,803 INFO L225 Difference]: With dead ends: 85 [2021-12-17 09:05:15,803 INFO L226 Difference]: Without dead ends: 80 [2021-12-17 09:05:15,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 79 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=307, Invalid=4421, Unknown=12, NotChecked=1740, Total=6480 [2021-12-17 09:05:15,805 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 70 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:05:15,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 664 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 822 Invalid, 0 Unknown, 339 Unchecked, 0.4s Time] [2021-12-17 09:05:15,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-17 09:05:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2021-12-17 09:05:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 09:05:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2021-12-17 09:05:15,812 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 46 [2021-12-17 09:05:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:05:15,812 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2021-12-17 09:05:15,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.75) internal successors, (112), 56 states have internal predecessors, (112), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-17 09:05:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2021-12-17 09:05:15,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-17 09:05:15,813 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:05:15,813 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:05:15,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 09:05:16,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-17 09:05:16,027 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:05:16,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:05:16,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2101316258, now seen corresponding path program 4 times [2021-12-17 09:05:16,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:05:16,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342139658] [2021-12-17 09:05:16,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:05:16,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:05:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:05:16,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 09:05:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:05:16,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 09:05:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:05:16,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 09:05:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:05:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 09:05:16,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:05:16,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342139658] [2021-12-17 09:05:16,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342139658] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:05:16,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707301584] [2021-12-17 09:05:16,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 09:05:16,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:05:16,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:05:16,113 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:05:16,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 09:05:16,256 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 09:05:16,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:05:16,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 09:05:16,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:05:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-17 09:05:16,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 09:05:16,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707301584] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:05:16,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 09:05:16,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-17 09:05:16,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449998866] [2021-12-17 09:05:16,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:05:16,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 09:05:16,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:05:16,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 09:05:16,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 09:05:16,320 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 09:05:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:05:16,335 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-12-17 09:05:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 09:05:16,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 47 [2021-12-17 09:05:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:05:16,337 INFO L225 Difference]: With dead ends: 80 [2021-12-17 09:05:16,337 INFO L226 Difference]: Without dead ends: 43 [2021-12-17 09:05:16,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 09:05:16,338 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:05:16,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 38 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:05:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-17 09:05:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-12-17 09:05:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:05:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-12-17 09:05:16,344 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 47 [2021-12-17 09:05:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:05:16,344 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-12-17 09:05:16,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 09:05:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-12-17 09:05:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-17 09:05:16,345 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:05:16,345 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] [2021-12-17 09:05:16,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 09:05:16,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:05:16,551 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:05:16,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:05:16,552 INFO L85 PathProgramCache]: Analyzing trace with hash -349906719, now seen corresponding path program 2 times [2021-12-17 09:05:16,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:05:16,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307056006] [2021-12-17 09:05:16,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:05:16,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:05:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:05:16,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 09:05:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:05:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 09:05:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:05:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 09:05:16,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:05:16,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307056006] [2021-12-17 09:05:16,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307056006] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:05:16,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525280672] [2021-12-17 09:05:16,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:05:16,641 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:05:16,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:05:16,642 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:05:16,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 09:05:16,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:05:16,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:05:16,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 09:05:16,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:05:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 09:05:16,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:05:16,961 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 09:05:16,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525280672] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:05:16,962 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:05:16,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2021-12-17 09:05:16,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085904185] [2021-12-17 09:05:16,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:05:16,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 09:05:16,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:05:16,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 09:05:16,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-17 09:05:16,964 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 09:05:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:05:17,026 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2021-12-17 09:05:17,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 09:05:17,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 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 47 [2021-12-17 09:05:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:05:17,027 INFO L225 Difference]: With dead ends: 43 [2021-12-17 09:05:17,027 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 09:05:17,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-17 09:05:17,028 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:05:17,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 80 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:05:17,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 09:05:17,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 09:05:17,029 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-12-17 09:05:17,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 09:05:17,029 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2021-12-17 09:05:17,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:05:17,029 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 09:05:17,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 09:05:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 09:05:17,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 09:05:17,032 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 09:05:17,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 09:05:17,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-17 09:05:17,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 09:05:32,263 WARN L227 SmtUtils]: Spent 14.02s on a formula simplification. DAG size of input: 50 DAG size of output: 30 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-17 09:06:24,525 WARN L227 SmtUtils]: Spent 52.07s on a formula simplification. DAG size of input: 56 DAG size of output: 51 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-17 09:08:02,676 WARN L227 SmtUtils]: Spent 1.64m on a formula simplification. DAG size of input: 84 DAG size of output: 79 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-17 09:08:02,681 INFO L861 garLoopResultBuilder]: At program point L638(lines 620 639) the Hoare annotation is: true [2021-12-17 09:08:02,681 INFO L854 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse7 (= |ULTIMATE.start_sll_circular_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse3 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse6 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse9 (= |ULTIMATE.start_main_~i~0#1| 1))) (or (and .cse0 (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) .cse1 (<= (+ |ULTIMATE.start_main_~i~0#1| 2) (+ |ULTIMATE.start_sll_circular_update_at_~index#1| |ULTIMATE.start_main_~len~0#1|)) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse2 (<= |ULTIMATE.start_sll_circular_update_at_~data#1| (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)) .cse3 (= |ULTIMATE.start_sll_circular_update_at_~data#1| |ULTIMATE.start_main_~len~0#1|) (= (select .cse4 |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) .cse5 .cse6 (forall ((v_ArrVal_1084 Int)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_1084)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (and .cse0 .cse7 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|) .cse2 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1) .cse3 (not (= .cse8 |ULTIMATE.start_main_~s~0#1.base|)) .cse5 (<= 1 |ULTIMATE.start_sll_circular_update_at_~index#1|) .cse6 (= (select .cse4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 0) .cse9) (and .cse0 (forall ((v_ArrVal_513 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_513) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) .cse1 .cse7 .cse3 (= .cse8 |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (forall ((v_ArrVal_1087 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1087) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (forall ((v_ArrVal_513 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_513) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)) .cse6 .cse2 (= 0 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) .cse9))) [2021-12-17 09:08:02,681 INFO L858 garLoopResultBuilder]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2021-12-17 09:08:02,681 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 09:08:02,681 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 09:08:02,681 INFO L858 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2021-12-17 09:08:02,681 INFO L861 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2021-12-17 09:08:02,681 INFO L858 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2021-12-17 09:08:02,682 INFO L854 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse19 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse3 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse2 (select (select |#memory_int| .cse19) 4))) (let ((.cse5 (<= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0)) (.cse10 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (.cse0 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse11 (<= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse12 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)) (.cse14 (<= .cse2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))) (.cse6 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse15 (not (= .cse19 |ULTIMATE.start_main_~s~0#1.base|))) (.cse16 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse7 (<= .cse3 .cse2)) (.cse17 (<= 2 |ULTIMATE.start_main_~len~0#1|)) (.cse9 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse8 (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)))) (or (and (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~expected~0#1| 2) .cse0 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|) .cse1 (<= .cse2 .cse3) .cse4 (= |ULTIMATE.start_main_~i~0#1| 0) .cse5 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) .cse6 .cse7 (= .cse8 2) .cse9 .cse10) (let ((.cse13 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (.cse18 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))) (and .cse0 .cse11 .cse1 .cse4 .cse12 .cse5 (not (= .cse13 |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) .cse14 .cse6 .cse15 .cse16 .cse7 (<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|) .cse17 .cse9 (= .cse18 0) .cse10 (= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| .cse13) (+ .cse18 4))) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1))) (and .cse0 .cse11 .cse1 .cse4 .cse12 .cse14 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) .cse6 .cse15 (<= .cse8 |ULTIMATE.start_main_~expected~0#1|) .cse16 .cse7 .cse17 .cse9 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_main_~expected~0#1| .cse8)))))) [2021-12-17 09:08:02,682 INFO L858 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2021-12-17 09:08:02,682 INFO L854 garLoopResultBuilder]: At program point L632(lines 620 639) the Hoare annotation is: false [2021-12-17 09:08:02,682 INFO L858 garLoopResultBuilder]: For program point L625-2(lines 625 628) no Hoare annotation was computed. [2021-12-17 09:08:02,682 INFO L854 garLoopResultBuilder]: At program point L625-3(lines 625 628) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse2 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse4 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)) (.cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse6 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse7 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (or (and .cse0 .cse1 .cse2 (not (= .cse3 |ULTIMATE.start_main_~s~0#1.base|)) .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~i~0#1| 1)) (and .cse0 (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse5 .cse7 (= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1084 Int)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084) |ULTIMATE.start_main_~s~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse8 (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084))) (let ((.cse9 (select .cse8 |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base| .cse8) .cse9 v_ArrVal_1088) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) .cse9))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |ULTIMATE.start_main_~s~0#1.offset|)))) (let ((.cse11 (select (select |#memory_int| .cse3) 4)) (.cse10 (+ |ULTIMATE.start_main_~len~0#1| 1))) (and .cse0 .cse1 .cse2 (<= .cse10 .cse11) .cse4 .cse5 .cse6 (<= .cse11 .cse10) .cse7 (<= 2 |ULTIMATE.start_main_~i~0#1|))))) [2021-12-17 09:08:02,682 INFO L858 garLoopResultBuilder]: For program point L625-4(lines 625 628) no Hoare annotation was computed. [2021-12-17 09:08:02,682 INFO L854 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_~len#1| |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_sll_circular_create_~len#1| 2)) [2021-12-17 09:08:02,682 INFO L858 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2021-12-17 09:08:02,682 INFO L854 garLoopResultBuilder]: At program point L593(lines 583 594) the Hoare annotation is: (and (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|))) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) [2021-12-17 09:08:02,682 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 09:08:02,683 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed. [2021-12-17 09:08:02,683 INFO L854 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~len~0#1| 2) .cse0 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 Int)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1082) |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse1 (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1082))) (let ((.cse2 (store (select .cse1 |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084))) (let ((.cse3 (select .cse2 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store .cse1 |ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2) .cse3 v_ArrVal_1088) |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse3)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (and (= |ULTIMATE.start_sll_circular_create_~len#1| |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_sll_circular_create_~len#1| 2) .cse0 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)))) [2021-12-17 09:08:02,683 INFO L858 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2021-12-17 09:08:02,683 INFO L854 garLoopResultBuilder]: At program point L611(lines 606 612) the Hoare annotation is: (let ((.cse8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse3 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse2 (select (select |#memory_int| .cse8) 4))) (let ((.cse0 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse4 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse5 (<= .cse3 .cse2)) (.cse7 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse6 (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)))) (or (and (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~expected~0#1| 2) .cse0 (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|) .cse1 (<= .cse2 .cse3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) .cse4 .cse5 (= .cse6 2) .cse7 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (and (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_circular_get_data_at_#res#1|) .cse0 (<= |ULTIMATE.start_main_~len~0#1| 2) .cse1 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= .cse2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) .cse4 (not (= .cse8 |ULTIMATE.start_main_~s~0#1.base|)) (<= .cse6 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) .cse5 .cse7 (<= |ULTIMATE.start_main_~expected~0#1| .cse6)))))) [2021-12-17 09:08:02,683 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 09:08:02,683 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2021-12-17 09:08:02,683 INFO L854 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_~len#1| |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_sll_circular_create_~len#1| 2) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)) [2021-12-17 09:08:02,683 INFO L858 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2021-12-17 09:08:02,683 INFO L858 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2021-12-17 09:08:02,683 INFO L858 garLoopResultBuilder]: For program point L629-2(lines 629 634) no Hoare annotation was computed. [2021-12-17 09:08:02,683 INFO L854 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse11 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse10 (select (select |#memory_int| .cse9) 4))) (let ((.cse3 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse0 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse4 (<= .cse11 .cse10)) (.cse1 (<= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse6 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse7 (<= .cse10 .cse11)) (.cse8 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse2 (or (and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 2) |ULTIMATE.start_main_~len~0#1|)) (and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|))))) (or (and .cse0 .cse1 .cse2 (<= 2 |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~len~0#1| 2) .cse0 .cse3 .cse4 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~i~0#1| 0)) (and .cse3 .cse0 (not (= .cse9 |ULTIMATE.start_main_~s~0#1.base|)) .cse4 .cse1 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (= |ULTIMATE.start_main_~i~0#1| 1) .cse2))))) [2021-12-17 09:08:02,684 INFO L858 garLoopResultBuilder]: For program point L629-4(lines 629 634) no Hoare annotation was computed. [2021-12-17 09:08:02,684 INFO L858 garLoopResultBuilder]: For program point L613(lines 613 619) no Hoare annotation was computed. [2021-12-17 09:08:02,684 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2021-12-17 09:08:02,684 INFO L858 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2021-12-17 09:08:02,684 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2021-12-17 09:08:02,684 INFO L854 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2021-12-17 09:08:02,684 INFO L858 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2021-12-17 09:08:02,684 INFO L858 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2021-12-17 09:08:02,687 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2021-12-17 09:08:02,701 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 09:08:02,727 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,728 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,728 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,728 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,728 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,740 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,740 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,740 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,740 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2021-12-17 09:08:02,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,748 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,748 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,748 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,748 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,748 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2021-12-17 09:08:02,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,748 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,748 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,757 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,757 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_513,QUANTIFIED] [2021-12-17 09:08:02,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] [2021-12-17 09:08:02,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_513,QUANTIFIED] [2021-12-17 09:08:02,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,774 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,774 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_513,QUANTIFIED] [2021-12-17 09:08:02,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,775 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] [2021-12-17 09:08:02,775 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_513,QUANTIFIED] [2021-12-17 09:08:02,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,778 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,778 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,779 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,779 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,779 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2021-12-17 09:08:02,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,781 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2021-12-17 09:08:02,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,788 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,788 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,788 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,792 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,792 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,792 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,792 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,792 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,793 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,795 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,795 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,795 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,795 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,795 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 09:08:02 BoogieIcfgContainer [2021-12-17 09:08:02,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 09:08:02,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 09:08:02,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 09:08:02,799 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 09:08:02,799 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:04:51" (3/4) ... [2021-12-17 09:08:02,802 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 09:08:02,806 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2021-12-17 09:08:02,817 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-12-17 09:08:02,817 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-17 09:08:02,818 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-17 09:08:02,818 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 09:08:02,836 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((len == 2 && !(last == head)) && head <= 0) && 0 <= head) && #memory_$Pointer$[head][head] == last) && \result == 0) && #memory_$Pointer$[\result][\result] == 0) && !(\result == #memory_$Pointer$[\result][\result])) && len <= 1 [2021-12-17 09:08:02,836 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((len == 2 && index <= 0) && s <= 0) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[s][s + 4] == len) && #memory_$Pointer$[s][s] == 0) && 0 <= s) && len <= 1) && i == 1) || (((((((((((len == 2 && !(last == head)) && head <= 0) && !(#memory_$Pointer$[\result][\result] == \result)) && 0 <= head) && #memory_$Pointer$[head][head] == last) && 0 <= \result) && #memory_$Pointer$[s][s] == 0) && len <= 1) && s == 0) && \result <= 0) && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 : int :: (((forall v_ArrVal_1084 : int :: !(s == #memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 + 4 := v_ArrVal_1084][s])) && 0 == i) && (forall v_ArrVal_1084 : int, v_ArrVal_1088 : [int]int :: #memory_$Pointer$[s := #memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 + 4 := v_ArrVal_1084]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 + 4 := v_ArrVal_1084][s] := v_ArrVal_1088][s][s] == #memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 + 4 := v_ArrVal_1084][s])) || v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 < s))) || (((((((((len == 2 && index <= 0) && s <= 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && unknown-#memory_int-unknown[s][s + 4] == len) && #memory_$Pointer$[s][s] == 0) && 0 <= s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= len + 1) && len <= 1) && 2 <= i) [2021-12-17 09:08:02,838 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((len == 2 && !(last == head)) && index <= 0) && i + 2 <= index + len) && 0 <= head) && 0 <= \result) && len <= 1) && data <= i + len) && head <= 0) && !(#memory_$Pointer$[\result][\result] == \result)) && s <= 0) && data == len) && #memory_$Pointer$[head][s] == 0) && #memory_$Pointer$[head][head] == last) && head == s) && 0 <= s) && (forall v_ArrVal_1084 : int :: !(s == #memory_$Pointer$[head := #memory_$Pointer$[head][head + 4 := v_ArrVal_1084]][s][s]))) && \result <= 0) && s == head) || ((((((((((((len == 2 && data == len + 1) && unknown-#memory_int-unknown[s][s + 4] == len) && len <= 1) && head == s) && index <= 1) && s <= 0) && !(#memory_$Pointer$[s][s] == s)) && head == s) && 1 <= index) && 0 <= s) && #memory_$Pointer$[head][head] == 0) && i == 1)) || (((((((((((len == 2 && (forall v_ArrVal_513 : [int]int :: len <= unknown-#memory_int-unknown[head := v_ArrVal_513][s][s + 4])) && index <= 0) && data == len + 1) && s <= 0) && #memory_$Pointer$[s][s] == head) && (forall v_ArrVal_1087 : [int]int :: #memory_$Pointer$[head := v_ArrVal_1087][s][s] == head)) && (forall v_ArrVal_513 : [int]int :: unknown-#memory_int-unknown[head := v_ArrVal_513][s][s + 4] <= len)) && 0 <= s) && len <= 1) && 0 == head) && i == 1) [2021-12-17 09:08:02,839 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((len == 2 && expected == 2) && index <= 0) && \result == 2) && unknown-#memory_int-unknown[s][s + 4] == len) && #memory_$Pointer$[s][s] == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= len + 1) && len <= 1) && i == 0) && head <= 0) && index == 0) && s <= 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && unknown-#memory_int-unknown[head][head + 4] == 2) && 0 <= s) && 0 <= head) || (((((((((((((expected <= \result && index <= 0) && len <= 2) && #memory_$Pointer$[s][s] == 0) && i + 1 <= len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= i + len) && head == 0) && s <= 0) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[head][head + 4] <= expected) && \result <= expected) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && 0 <= s) && expected <= unknown-#memory_int-unknown[head][head + 4]) [2021-12-17 09:08:02,870 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 09:08:02,870 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 09:08:02,871 INFO L158 Benchmark]: Toolchain (without parser) took 192150.83ms. Allocated memory was 81.8MB in the beginning and 174.1MB in the end (delta: 92.3MB). Free memory was 46.9MB in the beginning and 116.1MB in the end (delta: -69.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2021-12-17 09:08:02,872 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory was 60.9MB in the beginning and 60.9MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 09:08:02,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.51ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 46.7MB in the beginning and 66.8MB in the end (delta: -20.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-17 09:08:02,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.72ms. Allocated memory is still 98.6MB. Free memory was 66.8MB in the beginning and 64.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:08:02,873 INFO L158 Benchmark]: Boogie Preprocessor took 44.77ms. Allocated memory is still 98.6MB. Free memory was 64.7MB in the beginning and 63.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:08:02,873 INFO L158 Benchmark]: RCFGBuilder took 329.43ms. Allocated memory is still 98.6MB. Free memory was 63.0MB in the beginning and 49.6MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 09:08:02,873 INFO L158 Benchmark]: TraceAbstraction took 191197.47ms. Allocated memory was 98.6MB in the beginning and 174.1MB in the end (delta: 75.5MB). Free memory was 49.1MB in the beginning and 120.3MB in the end (delta: -71.2MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2021-12-17 09:08:02,873 INFO L158 Benchmark]: Witness Printer took 71.95ms. Allocated memory is still 174.1MB. Free memory was 120.3MB in the beginning and 116.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 09:08:02,881 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.18ms. Allocated memory is still 81.8MB. Free memory was 60.9MB in the beginning and 60.9MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.51ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 46.7MB in the beginning and 66.8MB in the end (delta: -20.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.72ms. Allocated memory is still 98.6MB. Free memory was 66.8MB in the beginning and 64.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.77ms. Allocated memory is still 98.6MB. Free memory was 64.7MB in the beginning and 63.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 329.43ms. Allocated memory is still 98.6MB. Free memory was 63.0MB in the beginning and 49.6MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 191197.47ms. Allocated memory was 98.6MB in the beginning and 174.1MB in the end (delta: 75.5MB). Free memory was 49.1MB in the beginning and 120.3MB in the end (delta: -71.2MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. * Witness Printer took 71.95ms. Allocated memory is still 174.1MB. Free memory was 120.3MB in the beginning and 116.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_513,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_513,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_513,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_513,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - 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: 637]: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 191.0s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 165.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 579 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 574 mSDsluCounter, 2319 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 672 IncrementalHoareTripleChecker+Unchecked, 1939 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1854 IncrementalHoareTripleChecker+Invalid, 2660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 380 mSDtfsCounter, 1854 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 879 GetRequests, 640 SyntacticMatches, 19 SemanticMatches, 220 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 15.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=11, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 111 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 18 PreInvPairs, 38 NumberOfFragments, 1270 HoareAnnotationTreeSize, 18 FomulaSimplifications, 7744 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 14 FomulaSimplificationsInter, 5584 FormulaSimplificationTreeSizeReductionInter, 165.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 896 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1154 ConstructedInterpolants, 28 QuantifiedInterpolants, 6637 SizeOfPredicates, 91 NumberOfNonLiveVariables, 3101 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 360/508 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: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant [2021-12-17 09:08:02,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((len == 2 && expected == 2) && index <= 0) && \result == 2) && unknown-#memory_int-unknown[s][s + 4] == len) && #memory_$Pointer$[s][s] == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= len + 1) && len <= 1) && i == 0) && head <= 0) && index == 0) && s <= 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && unknown-#memory_int-unknown[head][head + 4] == 2) && 0 <= s) && 0 <= head) || (((((((((((((expected <= \result && index <= 0) && len <= 2) && #memory_$Pointer$[s][s] == 0) && i + 1 <= len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= i + len) && head == 0) && s <= 0) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[head][head + 4] <= expected) && \result <= expected) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && 0 <= s) && expected <= unknown-#memory_int-unknown[head][head + 4]) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2021-12-17 09:08:02,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,924 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,924 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,924 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,925 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,925 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,925 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,925 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,926 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2021-12-17 09:08:02,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,926 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,926 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,926 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,927 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,927 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,927 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,927 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,929 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,929 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,929 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,929 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2021-12-17 09:08:02,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,931 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,931 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,931 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,931 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1082,QUANTIFIED] [2021-12-17 09:08:02,931 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,932 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,932 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] Derived loop invariant: (((((len == 2 && head == 0) && #memory_$Pointer$[head][head] == last) && #memory_$Pointer$[head][head] == 0) && len <= 1) && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 : int :: ((forall v_ArrVal_1082 : [int]int, v_ArrVal_1084 : int :: !(head == #memory_$Pointer$[last := v_ArrVal_1082][head][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 + 4 := v_ArrVal_1084][head])) && (forall v_ArrVal_1082 : [int]int, v_ArrVal_1084 : int, v_ArrVal_1088 : [int]int :: #memory_$Pointer$[last := v_ArrVal_1082][head := #memory_$Pointer$[last := v_ArrVal_1082][head][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 + 4 := v_ArrVal_1084]][#memory_$Pointer$[last := v_ArrVal_1082][head][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 + 4 := v_ArrVal_1084][head] := v_ArrVal_1088][head][head] == #memory_$Pointer$[last := v_ArrVal_1082][head][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 + 4 := v_ArrVal_1084][head])) || v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 < head)) || ((((len == len && len == 2) && head == 0) && last == head) && \valid[head] == 1) - InvariantResult [Line: 629]: Loop Invariant [2021-12-17 09:08:02,932 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((index <= 0 && len <= 2) && ((0 <= i && i + 2 <= len) || (2 <= len && 1 <= i))) && 2 <= i) || (((((((((len == 2 && index <= 0) && s <= 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && unknown-#memory_int-unknown[s][s + 4] == len) && #memory_$Pointer$[s][s] == 0) && 0 <= s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= len + 1) && len <= 1) && i == 0)) || (((((((((((s <= 0 && index <= 0) && !(#memory_$Pointer$[s][s] == s)) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && len <= 2) && #memory_$Pointer$[s][s] == 0) && 0 <= s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= len + 1) && len <= 1) && index <= 0) && i == 1) && ((0 <= i && i + 2 <= len) || (2 <= len && 1 <= i))) - InvariantResult [Line: 614]: Loop Invariant [2021-12-17 09:08:02,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,939 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,939 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_513,QUANTIFIED] [2021-12-17 09:08:02,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,940 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] [2021-12-17 09:08:02,940 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_513,QUANTIFIED] [2021-12-17 09:08:02,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,942 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,943 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_513,QUANTIFIED] [2021-12-17 09:08:02,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,944 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] [2021-12-17 09:08:02,944 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_513,QUANTIFIED] Derived loop invariant: (((((((((((((((((((len == 2 && !(last == head)) && index <= 0) && i + 2 <= index + len) && 0 <= head) && 0 <= \result) && len <= 1) && data <= i + len) && head <= 0) && !(#memory_$Pointer$[\result][\result] == \result)) && s <= 0) && data == len) && #memory_$Pointer$[head][s] == 0) && #memory_$Pointer$[head][head] == last) && head == s) && 0 <= s) && (forall v_ArrVal_1084 : int :: !(s == #memory_$Pointer$[head := #memory_$Pointer$[head][head + 4 := v_ArrVal_1084]][s][s]))) && \result <= 0) && s == head) || ((((((((((((len == 2 && data == len + 1) && unknown-#memory_int-unknown[s][s + 4] == len) && len <= 1) && head == s) && index <= 1) && s <= 0) && !(#memory_$Pointer$[s][s] == s)) && head == s) && 1 <= index) && 0 <= s) && #memory_$Pointer$[head][head] == 0) && i == 1)) || (((((((((((len == 2 && (forall v_ArrVal_513 : [int]int :: len <= unknown-#memory_int-unknown[head := v_ArrVal_513][s][s + 4])) && index <= 0) && data == len + 1) && s <= 0) && #memory_$Pointer$[s][s] == head) && (forall v_ArrVal_1087 : [int]int :: #memory_$Pointer$[head := v_ArrVal_1087][s][s] == head)) && (forall v_ArrVal_513 : [int]int :: unknown-#memory_int-unknown[head := v_ArrVal_513][s][s + 4] <= len)) && 0 <= s) && len <= 1) && 0 == head) && i == 1) - InvariantResult [Line: 625]: Loop Invariant [2021-12-17 09:08:02,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,946 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,946 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,950 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,950 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,950 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,950 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2021-12-17 09:08:02,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,954 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,954 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2021-12-17 09:08:02,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1084,QUANTIFIED] [2021-12-17 09:08:02,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20,QUANTIFIED] [2021-12-17 09:08:02,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,957 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,957 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((len == 2 && index <= 0) && s <= 0) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[s][s + 4] == len) && #memory_$Pointer$[s][s] == 0) && 0 <= s) && len <= 1) && i == 1) || (((((((((((len == 2 && !(last == head)) && head <= 0) && !(#memory_$Pointer$[\result][\result] == \result)) && 0 <= head) && #memory_$Pointer$[head][head] == last) && 0 <= \result) && #memory_$Pointer$[s][s] == 0) && len <= 1) && s == 0) && \result <= 0) && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 : int :: (((forall v_ArrVal_1084 : int :: !(s == #memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 + 4 := v_ArrVal_1084][s])) && 0 == i) && (forall v_ArrVal_1084 : int, v_ArrVal_1088 : [int]int :: #memory_$Pointer$[s := #memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 + 4 := v_ArrVal_1084]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 + 4 := v_ArrVal_1084][s] := v_ArrVal_1088][s][s] == #memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 + 4 := v_ArrVal_1084][s])) || v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 < s))) || (((((((((len == 2 && index <= 0) && s <= 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && unknown-#memory_int-unknown[s][s + 4] == len) && #memory_$Pointer$[s][s] == 0) && 0 <= s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= len + 1) && len <= 1) && 2 <= i) - InvariantResult [Line: 583]: Loop Invariant [2021-12-17 09:08:02,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((len == 2 && !(last == head)) && head <= 0) && 0 <= head) && #memory_$Pointer$[head][head] == last) && \result == 0) && #memory_$Pointer$[\result][\result] == 0) && !(\result == #memory_$Pointer$[\result][\result])) && len <= 1 - InvariantResult [Line: 607]: Loop Invariant [2021-12-17 09:08:02,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,961 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,961 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,961 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,962 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,962 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 09:08:02,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 09:08:02,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((len == 2 && expected == 2) && index <= 0) && unknown-#memory_int-unknown[s][s + 4] == len) && #memory_$Pointer$[s][s] == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= len + 1) && len <= 1) && i == 0) && head <= 0) && index == 0) && s <= 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && unknown-#memory_int-unknown[head][head + 4] == 2) && 0 <= s) && 0 <= head) || ((((((((((((((((((index <= 0 && len <= 2) && #memory_$Pointer$[s][s] == 0) && len <= 1) && i + 1 <= len) && head <= 0) && !(#memory_$Pointer$[head][head] == head)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= i + len) && s <= 0) && !(#memory_$Pointer$[s][s] == s)) && 0 <= i) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && 1 <= index) && 2 <= len) && 0 <= s) && #memory_$Pointer$[head][head] == 0) && 0 <= head) && expected == unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][#memory_$Pointer$[head][head] + 4]) && index <= 1)) || (((((((((((((((index <= 0 && len <= 2) && #memory_$Pointer$[s][s] == 0) && len <= 1) && i + 1 <= len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= i + len) && head == 0) && s <= 0) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[head][head + 4] <= expected) && 0 <= i) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && 2 <= len) && 0 <= s) && index <= 0) && expected <= unknown-#memory_int-unknown[head][head + 4]) RESULT: Ultimate proved your program to be correct! [2021-12-17 09:08:03,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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