./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 839c364b 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:43:13,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:43:13,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:43:13,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:43:13,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:43:13,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:43:13,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:43:13,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:43:13,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:43:13,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:43:13,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:43:13,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:43:13,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:43:13,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:43:13,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:43:13,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:43:13,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:43:13,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:43:13,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:43:13,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:43:13,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:43:13,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:43:13,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:43:13,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:43:13,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:43:13,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:43:13,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:43:13,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:43:13,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:43:13,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:43:13,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:43:13,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:43:13,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:43:13,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:43:13,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:43:13,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:43:13,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:43:13,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:43:13,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:43:13,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:43:13,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:43:14,000 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:43:14,018 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:43:14,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:43:14,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:43:14,020 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:43:14,021 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:43:14,021 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:43:14,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:43:14,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:43:14,022 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:43:14,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:43:14,023 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:43:14,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:43:14,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:43:14,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:43:14,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:43:14,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:43:14,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:43:14,024 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:43:14,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:43:14,024 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:43:14,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:43:14,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:43:14,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:43:14,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:43:14,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:43:14,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:43:14,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:43:14,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:43:14,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:43:14,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:43:14,026 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:43:14,026 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:43:14,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:43:14,026 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:43:14,026 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-14 13:43:14,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:43:14,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:43:14,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:43:14,232 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:43:14,232 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:43:14,233 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-14 13:43:14,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b077d44/2ba95d1ec8634a698b456bb6dbb0f1e2/FLAG62a99784e [2021-12-14 13:43:14,631 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:43:14,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-14 13:43:14,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b077d44/2ba95d1ec8634a698b456bb6dbb0f1e2/FLAG62a99784e [2021-12-14 13:43:15,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b077d44/2ba95d1ec8634a698b456bb6dbb0f1e2 [2021-12-14 13:43:15,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:43:15,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:43:15,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:43:15,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:43:15,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:43:15,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:43:15" (1/1) ... [2021-12-14 13:43:15,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7289af7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:15, skipping insertion in model container [2021-12-14 13:43:15,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:43:15" (1/1) ... [2021-12-14 13:43:15,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:43:15,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:43:15,309 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-14 13:43:15,314 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:43:15,320 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:43:15,350 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-14 13:43:15,351 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:43:15,383 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:43:15,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:15 WrapperNode [2021-12-14 13:43:15,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:43:15,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:43:15,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:43:15,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:43:15,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:15" (1/1) ... [2021-12-14 13:43:15,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:15" (1/1) ... [2021-12-14 13:43:15,431 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2021-12-14 13:43:15,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:43:15,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:43:15,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:43:15,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:43:15,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:15" (1/1) ... [2021-12-14 13:43:15,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:15" (1/1) ... [2021-12-14 13:43:15,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:15" (1/1) ... [2021-12-14 13:43:15,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:15" (1/1) ... [2021-12-14 13:43:15,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:15" (1/1) ... [2021-12-14 13:43:15,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:15" (1/1) ... [2021-12-14 13:43:15,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:15" (1/1) ... [2021-12-14 13:43:15,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:43:15,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:43:15,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:43:15,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:43:15,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:15" (1/1) ... [2021-12-14 13:43:15,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:43:15,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:15,499 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-14 13:43:15,522 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-14 13:43:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 13:43:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 13:43:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-14 13:43:15,535 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-14 13:43:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 13:43:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:43:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 13:43:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 13:43:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 13:43:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:43:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:43:15,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:43:15,641 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:43:15,642 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:43:15,791 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:43:15,795 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:43:15,798 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-14 13:43:15,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:43:15 BoogieIcfgContainer [2021-12-14 13:43:15,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:43:15,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:43:15,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:43:15,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:43:15,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:43:15" (1/3) ... [2021-12-14 13:43:15,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a62b47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:43:15, skipping insertion in model container [2021-12-14 13:43:15,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:15" (2/3) ... [2021-12-14 13:43:15,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a62b47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:43:15, skipping insertion in model container [2021-12-14 13:43:15,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:43:15" (3/3) ... [2021-12-14 13:43:15,818 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2021-12-14 13:43:15,821 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:43:15,821 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:43:15,849 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:43:15,856 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-14 13:43:15,856 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:43:15,868 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-14 13:43:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 13:43:15,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:15,872 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-14 13:43:15,873 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:15,876 INFO L85 PathProgramCache]: Analyzing trace with hash 663980757, now seen corresponding path program 1 times [2021-12-14 13:43:15,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:15,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132172263] [2021-12-14 13:43:15,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:15,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:15,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:16,004 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-14 13:43:16,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:16,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132172263] [2021-12-14 13:43:16,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132172263] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:43:16,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:43:16,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:43:16,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535173693] [2021-12-14 13:43:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:43:16,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:43:16,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:16,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:43:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:43:16,028 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-14 13:43:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:16,074 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2021-12-14 13:43:16,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:43:16,077 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-14 13:43:16,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:16,089 INFO L225 Difference]: With dead ends: 61 [2021-12-14 13:43:16,089 INFO L226 Difference]: Without dead ends: 28 [2021-12-14 13:43:16,091 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-14 13:43:16,095 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-14 13:43:16,096 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-14 13:43:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-14 13:43:16,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-14 13:43:16,119 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-14 13:43:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-12-14 13:43:16,121 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20 [2021-12-14 13:43:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:16,122 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-14 13:43:16,122 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-14 13:43:16,122 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-12-14 13:43:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 13:43:16,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:16,123 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-14 13:43:16,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:43:16,124 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:16,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:16,126 INFO L85 PathProgramCache]: Analyzing trace with hash 616475652, now seen corresponding path program 1 times [2021-12-14 13:43:16,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:16,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635285317] [2021-12-14 13:43:16,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:16,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:16,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:16,254 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-14 13:43:16,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:16,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635285317] [2021-12-14 13:43:16,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635285317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:43:16,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:43:16,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:43:16,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448060646] [2021-12-14 13:43:16,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:43:16,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:43:16,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:16,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:43:16,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:43:16,259 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-14 13:43:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:16,289 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2021-12-14 13:43:16,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:43:16,290 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-14 13:43:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:16,291 INFO L225 Difference]: With dead ends: 47 [2021-12-14 13:43:16,291 INFO L226 Difference]: Without dead ends: 31 [2021-12-14 13:43:16,294 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-14 13:43:16,295 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-14 13:43:16,296 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-14 13:43:16,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-14 13:43:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-12-14 13:43:16,305 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-14 13:43:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2021-12-14 13:43:16,306 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20 [2021-12-14 13:43:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:16,308 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2021-12-14 13:43:16,308 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-14 13:43:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2021-12-14 13:43:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 13:43:16,311 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:16,311 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-14 13:43:16,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 13:43:16,312 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:16,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:16,313 INFO L85 PathProgramCache]: Analyzing trace with hash -600691076, now seen corresponding path program 1 times [2021-12-14 13:43:16,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:16,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303689886] [2021-12-14 13:43:16,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:16,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:16,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:16,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:16,444 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-14 13:43:16,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:16,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303689886] [2021-12-14 13:43:16,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303689886] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:43:16,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:43:16,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:43:16,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85331484] [2021-12-14 13:43:16,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:43:16,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:43:16,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:16,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:43:16,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:43:16,448 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.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-14 13:43:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:16,495 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2021-12-14 13:43:16,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:43:16,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.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-14 13:43:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:16,497 INFO L225 Difference]: With dead ends: 51 [2021-12-14 13:43:16,497 INFO L226 Difference]: Without dead ends: 42 [2021-12-14 13:43:16,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:43:16,502 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:16,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 72 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:43:16,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-14 13:43:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2021-12-14 13:43:16,513 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-14 13:43:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-14 13:43:16,515 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 28 [2021-12-14 13:43:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:16,515 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-14 13:43:16,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.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-14 13:43:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-14 13:43:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 13:43:16,516 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:16,516 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-14 13:43:16,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:43:16,516 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:16,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:16,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1948852891, now seen corresponding path program 1 times [2021-12-14 13:43:16,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:16,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745794677] [2021-12-14 13:43:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:16,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:16,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:16,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:16,619 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-14 13:43:16,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:16,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745794677] [2021-12-14 13:43:16,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745794677] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:43:16,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436571906] [2021-12-14 13:43:16,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:16,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:16,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:16,622 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-14 13:43:16,623 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-14 13:43:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:16,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 13:43:16,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:43:16,836 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-14 13:43:16,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:43:16,904 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-14 13:43:16,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436571906] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:43:16,905 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:43:16,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2021-12-14 13:43:16,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164848960] [2021-12-14 13:43:16,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:43:16,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:43:16,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:16,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:43:16,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:43:16,907 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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-14 13:43:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:16,944 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2021-12-14 13:43:16,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:43:16,944 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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-14 13:43:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:16,945 INFO L225 Difference]: With dead ends: 53 [2021-12-14 13:43:16,945 INFO L226 Difference]: Without dead ends: 44 [2021-12-14 13:43:16,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:43:16,946 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 36 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:16,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 100 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:43:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-14 13:43:16,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2021-12-14 13:43:16,949 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-14 13:43:16,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2021-12-14 13:43:16,950 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 33 [2021-12-14 13:43:16,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:16,950 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2021-12-14 13:43:16,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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-14 13:43:16,951 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-12-14 13:43:16,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 13:43:16,951 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:16,951 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-14 13:43:16,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 13:43:17,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:17,170 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:17,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:17,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2072516636, now seen corresponding path program 2 times [2021-12-14 13:43:17,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:17,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553802613] [2021-12-14 13:43:17,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:17,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:17,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:17,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 13:43:17,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:17,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553802613] [2021-12-14 13:43:17,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553802613] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:43:17,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485303999] [2021-12-14 13:43:17,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:43:17,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:17,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:17,230 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-14 13:43:17,231 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-14 13:43:17,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:43:17,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:43:17,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 13:43:17,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:43:17,383 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-14 13:43:17,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:43:17,434 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-14 13:43:17,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485303999] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:43:17,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:43:17,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-12-14 13:43:17,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885380080] [2021-12-14 13:43:17,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:43:17,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:43:17,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:17,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:43:17,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:43:17,436 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 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-14 13:43:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:17,492 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2021-12-14 13:43:17,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:43:17,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 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 38 [2021-12-14 13:43:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:17,493 INFO L225 Difference]: With dead ends: 58 [2021-12-14 13:43:17,493 INFO L226 Difference]: Without dead ends: 44 [2021-12-14 13:43:17,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:43:17,494 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 32 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:17,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 142 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:43:17,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-14 13:43:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2021-12-14 13:43:17,497 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-14 13:43:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2021-12-14 13:43:17,498 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 38 [2021-12-14 13:43:17,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:17,498 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2021-12-14 13:43:17,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 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-14 13:43:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2021-12-14 13:43:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 13:43:17,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:17,499 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-14 13:43:17,518 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-14 13:43:17,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:17,714 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:17,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:17,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1973765418, now seen corresponding path program 1 times [2021-12-14 13:43:17,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:17,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644850780] [2021-12-14 13:43:17,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:17,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:18,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:18,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:18,158 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-14 13:43:18,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:18,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644850780] [2021-12-14 13:43:18,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644850780] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:43:18,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745392505] [2021-12-14 13:43:18,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:18,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:18,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:18,160 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-14 13:43:18,182 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-14 13:43:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:18,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 94 conjunts are in the unsatisfiable core [2021-12-14 13:43:18,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:43:18,318 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-14 13:43:18,467 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:43:18,467 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-14 13:43:18,490 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-14 13:43:18,531 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:43:18,531 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-14 13:43:18,619 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-14 13:43:18,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:43:18,623 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-14 13:43:18,714 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-14 13:43:18,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, 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-14 13:43:18,872 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-14 13:43:18,926 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-14 13:43:18,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:43:19,053 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_477 (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_477) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_477 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_477) |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-14 13:43:19,069 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_477 (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_477) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_477 (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_477) |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-14 13:43:19,078 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_477 (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_477) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_477 (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_477) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2021-12-14 13:43:19,115 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:43:19,116 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-14 13:43:19,123 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:43:19,123 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-14 13:43:19,127 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-14 13:43:19,167 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:43:19,167 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-14 13:43:19,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:43:19,171 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-14 13:43:19,175 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-14 13:43:19,315 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_475 Int) (v_ArrVal_472 (Array Int 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_472) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_475) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-14 13:43:19,326 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:43:19,326 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-14 13:43:19,328 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-14 13:43:19,330 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-14 13:43:19,340 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-14 13:43:19,671 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-14 13:43:19,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745392505] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:43:19,671 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:43:19,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 57 [2021-12-14 13:43:19,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374985654] [2021-12-14 13:43:19,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:43:19,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-12-14 13:43:19,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:19,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-12-14 13:43:19,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2591, Unknown=4, NotChecked=420, Total=3192 [2021-12-14 13:43:19,673 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 57 states, 56 states have (on average 1.625) internal successors, (91), 48 states have internal predecessors, (91), 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-14 13:43:20,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:20,802 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2021-12-14 13:43:20,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 13:43:20,803 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.625) internal successors, (91), 48 states have internal predecessors, (91), 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-14 13:43:20,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:20,806 INFO L225 Difference]: With dead ends: 90 [2021-12-14 13:43:20,806 INFO L226 Difference]: Without dead ends: 88 [2021-12-14 13:43:20,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=438, Invalid=4686, Unknown=4, NotChecked=572, Total=5700 [2021-12-14 13:43:20,809 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 213 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 414 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:20,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 606 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 675 Invalid, 0 Unknown, 414 Unchecked, 0.3s Time] [2021-12-14 13:43:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-14 13:43:20,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 64. [2021-12-14 13:43:20,817 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-14 13:43:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2021-12-14 13:43:20,817 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 39 [2021-12-14 13:43:20,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:20,818 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2021-12-14 13:43:20,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.625) internal successors, (91), 48 states have internal predecessors, (91), 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-14 13:43:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2021-12-14 13:43:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 13:43:20,819 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:20,819 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-14 13:43:20,840 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-14 13:43:21,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:21,038 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:21,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:21,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1005531927, now seen corresponding path program 1 times [2021-12-14 13:43:21,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:21,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236423400] [2021-12-14 13:43:21,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:21,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:21,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:21,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:21,086 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-14 13:43:21,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:21,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236423400] [2021-12-14 13:43:21,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236423400] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:43:21,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:43:21,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:43:21,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968266127] [2021-12-14 13:43:21,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:43:21,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:43:21,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:21,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:43:21,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:43:21,088 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-14 13:43:21,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:21,118 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2021-12-14 13:43:21,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:43:21,119 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-14 13:43:21,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:21,120 INFO L225 Difference]: With dead ends: 81 [2021-12-14 13:43:21,120 INFO L226 Difference]: Without dead ends: 73 [2021-12-14 13:43:21,120 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-14 13:43:21,121 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-14 13:43:21,121 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-14 13:43:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-14 13:43:21,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2021-12-14 13:43:21,126 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-14 13:43:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2021-12-14 13:43:21,126 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 40 [2021-12-14 13:43:21,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:21,127 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2021-12-14 13:43:21,127 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-14 13:43:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2021-12-14 13:43:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 13:43:21,128 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:21,128 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-14 13:43:21,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 13:43:21,128 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:21,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:21,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1440509788, now seen corresponding path program 2 times [2021-12-14 13:43:21,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:21,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726092613] [2021-12-14 13:43:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:21,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:21,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:21,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:21,177 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-14 13:43:21,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:21,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726092613] [2021-12-14 13:43:21,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726092613] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:43:21,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796909036] [2021-12-14 13:43:21,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:43:21,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:21,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:21,192 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-14 13:43:21,213 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-14 13:43:21,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:43:21,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:43:21,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 13:43:21,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:43:21,351 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-14 13:43:21,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:43:21,396 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-14 13:43:21,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796909036] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:43:21,396 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:43:21,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2021-12-14 13:43:21,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495170883] [2021-12-14 13:43:21,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:43:21,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 13:43:21,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:21,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 13:43:21,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:43:21,398 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-14 13:43:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:21,445 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2021-12-14 13:43:21,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 13:43:21,446 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-14 13:43:21,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:21,446 INFO L225 Difference]: With dead ends: 112 [2021-12-14 13:43:21,446 INFO L226 Difference]: Without dead ends: 90 [2021-12-14 13:43:21,447 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-14 13:43:21,447 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-14 13:43:21,447 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-14 13:43:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-14 13:43:21,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2021-12-14 13:43:21,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.125) internal successors, (72), 64 states have internal predecessors, (72), 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-14 13:43:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2021-12-14 13:43:21,485 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 40 [2021-12-14 13:43:21,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:21,485 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2021-12-14 13:43:21,485 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-14 13:43:21,486 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2021-12-14 13:43:21,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 13:43:21,486 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:21,486 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-14 13:43:21,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 13:43:21,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:21,703 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:21,704 INFO L85 PathProgramCache]: Analyzing trace with hash 896238913, now seen corresponding path program 1 times [2021-12-14 13:43:21,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:21,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726351171] [2021-12-14 13:43:21,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:21,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:21,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:21,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:21,756 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-14 13:43:21,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:21,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726351171] [2021-12-14 13:43:21,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726351171] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:43:21,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262680896] [2021-12-14 13:43:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:21,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:21,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:21,758 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-14 13:43:21,777 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-14 13:43:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:21,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 13:43:21,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:43:21,934 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-14 13:43:21,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:43:21,982 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-14 13:43:21,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262680896] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:43:21,982 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:43:21,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-12-14 13:43:21,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770740503] [2021-12-14 13:43:21,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:43:21,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:43:21,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:21,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:43:21,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:43:21,983 INFO L87 Difference]: Start difference. First operand 70 states and 78 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-14 13:43:22,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:22,021 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2021-12-14 13:43:22,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:43:22,021 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-14 13:43:22,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:22,022 INFO L225 Difference]: With dead ends: 85 [2021-12-14 13:43:22,022 INFO L226 Difference]: Without dead ends: 77 [2021-12-14 13:43:22,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:43:22,023 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 29 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:22,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 137 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:43:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-14 13:43:22,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2021-12-14 13:43:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 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-14 13:43:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2021-12-14 13:43:22,028 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 45 [2021-12-14 13:43:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:22,029 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2021-12-14 13:43:22,029 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-14 13:43:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2021-12-14 13:43:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 13:43:22,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:22,029 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-14 13:43:22,046 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-14 13:43:22,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:22,246 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:22,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:22,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2065256414, now seen corresponding path program 1 times [2021-12-14 13:43:22,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:22,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476155989] [2021-12-14 13:43:22,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:22,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:22,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:22,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:22,815 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-14 13:43:22,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:22,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476155989] [2021-12-14 13:43:22,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476155989] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:43:22,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883286607] [2021-12-14 13:43:22,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:22,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:22,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:22,832 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-14 13:43:22,833 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-14 13:43:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:22,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 105 conjunts are in the unsatisfiable core [2021-12-14 13:43:22,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:43:22,959 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-14 13:43:23,129 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:43:23,129 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-14 13:43:23,167 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-14 13:43:23,219 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:43:23,219 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-14 13:43:23,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:43:23,350 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-14 13:43:23,516 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:43:23,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 13:43:23,520 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-14 13:43:23,522 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-14 13:43:23,789 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-14 13:43:23,792 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-14 13:43:23,825 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-14 13:43:23,900 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-14 13:43:23,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:43:24,187 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-14 13:43:24,204 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_917 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_917) |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|)) (= (+ |c_ULTIMATE.start_main_~len~0#1| 1) |c_ULTIMATE.start_sll_circular_update_at_~data#1|) (forall ((v_ArrVal_920 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_920) |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-14 13:43:24,248 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:43:24,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-14 13:43:24,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-12-14 13:43:26,463 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_916 Int)) (not (= (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_916) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |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-14 13:43:28,473 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (forall ((v_ArrVal_916 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_916) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) is different from false [2021-12-14 13:43:28,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (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_914) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_916) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-14 13:43:28,499 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:43:28,499 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-14 13:43:28,502 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-14 13:43:28,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:43:28,505 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 27 treesize of output 25 [2021-12-14 13:43:28,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:43:28,508 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 27 treesize of output 23 [2021-12-14 13:43:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-12-14 13:43:28,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883286607] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:43:28,870 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:43:28,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 25] total 64 [2021-12-14 13:43:28,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207605193] [2021-12-14 13:43:28,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:43:28,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-12-14 13:43:28,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:28,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-12-14 13:43:28,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3366, Unknown=4, NotChecked=476, Total=4032 [2021-12-14 13:43:28,872 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 64 states, 64 states have (on average 1.734375) internal successors, (111), 55 states have internal predecessors, (111), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-14 13:43:29,461 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 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (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_914) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_916) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (= (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))) is different from false [2021-12-14 13:43:29,760 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (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 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (forall ((v_ArrVal_916 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_916) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))))) is different from false [2021-12-14 13:43:30,050 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_916 Int)) (not (= (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_916) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)) is different from false [2021-12-14 13:43:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:30,999 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2021-12-14 13:43:31,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 13:43:31,015 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.734375) internal successors, (111), 55 states have internal predecessors, (111), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2021-12-14 13:43:31,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:31,016 INFO L225 Difference]: With dead ends: 113 [2021-12-14 13:43:31,016 INFO L226 Difference]: Without dead ends: 111 [2021-12-14 13:43:31,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 49 SyntacticMatches, 8 SemanticMatches, 82 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=380, Invalid=5493, Unknown=7, NotChecked=1092, Total=6972 [2021-12-14 13:43:31,018 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 114 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:31,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 786 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 987 Invalid, 0 Unknown, 299 Unchecked, 0.4s Time] [2021-12-14 13:43:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-14 13:43:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 85. [2021-12-14 13:43:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.1265822784810127) internal successors, (89), 79 states have internal predecessors, (89), 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-14 13:43:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2021-12-14 13:43:31,025 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 46 [2021-12-14 13:43:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:31,025 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2021-12-14 13:43:31,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.734375) internal successors, (111), 55 states have internal predecessors, (111), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-14 13:43:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2021-12-14 13:43:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 13:43:31,026 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:31,026 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:43:31,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 13:43:31,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:31,246 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:31,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:31,246 INFO L85 PathProgramCache]: Analyzing trace with hash -870661941, now seen corresponding path program 3 times [2021-12-14 13:43:31,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:31,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203538720] [2021-12-14 13:43:31,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:31,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:31,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 13:43:31,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:31,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203538720] [2021-12-14 13:43:31,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203538720] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:43:31,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387292262] [2021-12-14 13:43:31,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 13:43:31,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:31,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:31,333 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-14 13:43:31,334 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-14 13:43:31,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 13:43:31,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:43:31,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 13:43:31,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:43:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 13:43:31,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:43:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 13:43:31,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387292262] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:43:31,660 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:43:31,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2021-12-14 13:43:31,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669769346] [2021-12-14 13:43:31,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:43:31,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 13:43:31,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:31,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 13:43:31,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-14 13:43:31,662 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 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-14 13:43:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:31,709 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2021-12-14 13:43:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 13:43:31,709 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2021-12-14 13:43:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:31,709 INFO L225 Difference]: With dead ends: 111 [2021-12-14 13:43:31,710 INFO L226 Difference]: Without dead ends: 76 [2021-12-14 13:43:31,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-12-14 13:43:31,716 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 88 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:31,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 112 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:43:31,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-14 13:43:31,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2021-12-14 13:43:31,723 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-14 13:43:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2021-12-14 13:43:31,723 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 46 [2021-12-14 13:43:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:31,724 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2021-12-14 13:43:31,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 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-14 13:43:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2021-12-14 13:43:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-14 13:43:31,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:31,725 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-14 13:43:31,744 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-14 13:43:31,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:31,942 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:31,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash -2101316258, now seen corresponding path program 4 times [2021-12-14 13:43:31,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:31,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176532627] [2021-12-14 13:43:31,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:31,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:31,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 13:43:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:32,000 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-14 13:43:32,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:32,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176532627] [2021-12-14 13:43:32,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176532627] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:43:32,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010588466] [2021-12-14 13:43:32,001 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 13:43:32,001 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:32,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:32,002 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-14 13:43:32,020 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-14 13:43:32,144 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 13:43:32,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:43:32,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 13:43:32,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:43:32,209 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-14 13:43:32,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:43:32,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010588466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:43:32,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:43:32,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-14 13:43:32,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624590233] [2021-12-14 13:43:32,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:43:32,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:43:32,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:32,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:43:32,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:43:32,211 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-14 13:43:32,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:32,220 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-12-14 13:43:32,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:43:32,220 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-14 13:43:32,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:32,220 INFO L225 Difference]: With dead ends: 80 [2021-12-14 13:43:32,221 INFO L226 Difference]: Without dead ends: 43 [2021-12-14 13:43:32,221 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-14 13:43:32,221 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 45 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-14 13:43:32,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:43:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-14 13:43:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-12-14 13:43:32,225 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-14 13:43:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-12-14 13:43:32,225 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 47 [2021-12-14 13:43:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:32,225 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-12-14 13:43:32,226 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-14 13:43:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-12-14 13:43:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-14 13:43:32,226 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:32,226 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-14 13:43:32,254 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-14 13:43:32,439 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,SelfDestructingSolverStorable11 [2021-12-14 13:43:32,440 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:32,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:32,440 INFO L85 PathProgramCache]: Analyzing trace with hash -349906719, now seen corresponding path program 2 times [2021-12-14 13:43:32,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:32,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041395557] [2021-12-14 13:43:32,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:32,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:32,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:32,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:32,505 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-14 13:43:32,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:32,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041395557] [2021-12-14 13:43:32,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041395557] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:43:32,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048682125] [2021-12-14 13:43:32,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:43:32,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:32,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:32,516 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-14 13:43:32,543 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-14 13:43:32,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:43:32,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:43:32,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 13:43:32,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:43:32,705 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-14 13:43:32,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:43:32,774 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-14 13:43:32,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048682125] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:43:32,775 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:43:32,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2021-12-14 13:43:32,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272209272] [2021-12-14 13:43:32,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:43:32,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 13:43:32,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:32,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 13:43:32,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:43:32,777 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-14 13:43:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:32,828 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2021-12-14 13:43:32,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 13:43:32,829 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-14 13:43:32,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:32,830 INFO L225 Difference]: With dead ends: 43 [2021-12-14 13:43:32,830 INFO L226 Difference]: Without dead ends: 0 [2021-12-14 13:43:32,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:43:32,834 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-14 13:43:32,835 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-14 13:43:32,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-14 13:43:32,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-14 13:43:32,836 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-14 13:43:32,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 13:43:32,836 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2021-12-14 13:43:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:32,836 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 13:43:32,836 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-14 13:43:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-14 13:43:32,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-14 13:43:32,839 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 13:43:32,859 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-14 13:43:33,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-14 13:43:33,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-14 13:44:26,464 WARN L227 SmtUtils]: Spent 52.46s on a formula simplification. DAG size of input: 41 DAG size of output: 38 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-14 13:44:30,707 INFO L861 garLoopResultBuilder]: At program point L638(lines 620 639) the Hoare annotation is: true [2021-12-14 13:44:30,707 INFO L854 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse3 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse12 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse7 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse10 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse11 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse1 (= (+ |ULTIMATE.start_main_~len~0#1| 1) |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse2 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and (= .cse0 0) .cse1 .cse2 .cse3 .cse4 (forall ((v_ArrVal_920 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_920) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) .cse5 (= .cse0 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) .cse6 (not .cse7) .cse8)) (let ((.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse9) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) .cse7 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select .cse10 |ULTIMATE.start_main_~s~0#1.offset|))) .cse11 (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|)) .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse5 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse9)) (= (select .cse12 |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse8)) (and (= (select .cse12 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 0) .cse7 (not (= (select .cse10 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1) .cse11 (<= 1 |ULTIMATE.start_sll_circular_update_at_~index#1|) .cse1 .cse2 .cse4 .cse5 .cse6 .cse8))) [2021-12-14 13:44:30,707 INFO L858 garLoopResultBuilder]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2021-12-14 13:44:30,707 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-14 13:44:30,707 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-14 13:44:30,707 INFO L858 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2021-12-14 13:44:30,707 INFO L861 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2021-12-14 13:44:30,707 INFO L858 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2021-12-14 13:44:30,708 INFO L854 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse13 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse14 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse5 (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))) (.cse6 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse7 (not (= .cse14 |ULTIMATE.start_main_~s~0#1.base|))) (.cse8 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (= (select (select |#memory_int| .cse14) (+ .cse13 4)) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse2 (= .cse13 0)) (.cse3 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (< |ULTIMATE.start_sll_circular_update_at_~index#1| 1)) (.cse10 (<= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse0 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|))) (and (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select .cse0 4)) .cse1 .cse2 (= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) .cse3 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) .cse4 (= |ULTIMATE.start_main_~len~0#1| (select .cse0 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (= .cse5 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (and .cse6 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_main_~expected~0#1| .cse5) .cse7 .cse8 .cse1 .cse2 .cse3 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) .cse4 .cse9 (<= .cse5 |ULTIMATE.start_main_~expected~0#1|) .cse10) (let ((.cse11 (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|))) (let ((.cse12 (select (select |#memory_int| .cse11) 4))) (and .cse6 (<= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) (= (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|) 0) (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| .cse11)) .cse7 .cse8 .cse1 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|) .cse2 .cse3 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) .cse4 .cse9 .cse10 (<= .cse12 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~expected~0#1| .cse12))))))) [2021-12-14 13:44:30,708 INFO L858 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2021-12-14 13:44:30,708 INFO L854 garLoopResultBuilder]: At program point L632(lines 620 639) the Hoare annotation is: false [2021-12-14 13:44:30,708 INFO L858 garLoopResultBuilder]: For program point L625-2(lines 625 628) no Hoare annotation was computed. [2021-12-14 13:44:30,708 INFO L854 garLoopResultBuilder]: At program point L625-3(lines 625 628) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse3 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (= .cse1 0)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= (select (select |#memory_int| .cse0) (+ .cse1 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) .cse2 .cse3 .cse4 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse5 (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) .cse6) (and (= |ULTIMATE.start_main_~i~0#1| 1) .cse2 .cse3 (forall ((v_ArrVal_477 (Array Int Int))) (<= (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_477) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)) .cse4 .cse5 .cse6 (forall ((v_ArrVal_477 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_477) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))))) (let ((.cse7 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse7) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= .cse0 |ULTIMATE.start_main_~s~0#1.base|)) .cse2 (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|)) .cse4 .cse5 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse7)) .cse6))))) [2021-12-14 13:44:30,708 INFO L858 garLoopResultBuilder]: For program point L625-4(lines 625 628) no Hoare annotation was computed. [2021-12-14 13:44:30,708 INFO L854 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2)) [2021-12-14 13:44:30,708 INFO L858 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2021-12-14 13:44:30,708 INFO L854 garLoopResultBuilder]: At program point L593(lines 583 594) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#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) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |ULTIMATE.start_sll_circular_create_#res#1.offset|) (forall ((v_ArrVal_916 Int)) (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_916) |ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)))) [2021-12-14 13:44:30,708 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-14 13:44:30,708 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed. [2021-12-14 13:44:30,708 INFO L854 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) .cse1 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) .cse2 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))) (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) .cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) .cse2 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)))) [2021-12-14 13:44:30,709 INFO L858 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2021-12-14 13:44:30,709 INFO L854 garLoopResultBuilder]: At program point L611(lines 606 612) the Hoare annotation is: (let ((.cse5 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse6 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse1 (= (select (select |#memory_int| .cse5) (+ .cse6 4)) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse2 (= .cse6 0)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (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 (let ((.cse0 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|))) (and (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select .cse0 4)) .cse1 .cse2 (= 2 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) .cse3 (= |ULTIMATE.start_main_~len~0#1| (select .cse0 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (= .cse4 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~expected~0#1| .cse4) (not (= .cse5 |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_circular_get_data_at_#res#1|) .cse2 (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) .cse3 (< |ULTIMATE.start_sll_circular_update_at_~index#1| 1) (<= .cse4 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))))) [2021-12-14 13:44:30,709 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-14 13:44:30,709 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2021-12-14 13:44:30,709 INFO L854 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 2) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) [2021-12-14 13:44:30,709 INFO L858 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2021-12-14 13:44:30,709 INFO L858 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2021-12-14 13:44:30,710 INFO L858 garLoopResultBuilder]: For program point L629-2(lines 629 634) no Hoare annotation was computed. [2021-12-14 13:44:30,710 INFO L854 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse7 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse1 (= (select (select |#memory_int| .cse6) (+ .cse7 4)) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse2 (= .cse7 0)) (.cse3 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (< |ULTIMATE.start_sll_circular_update_at_~index#1| 1))) (or (let ((.cse0 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|))) (and (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select .cse0 4)) .cse1 .cse2 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) .cse3 .cse4 (= |ULTIMATE.start_main_~len~0#1| (select .cse0 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse4 .cse5) (and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (not (= .cse6 |ULTIMATE.start_main_~s~0#1.base|)) .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_main_~s~0#1.offset| 0))))) [2021-12-14 13:44:30,710 INFO L858 garLoopResultBuilder]: For program point L629-4(lines 629 634) no Hoare annotation was computed. [2021-12-14 13:44:30,710 INFO L858 garLoopResultBuilder]: For program point L613(lines 613 619) no Hoare annotation was computed. [2021-12-14 13:44:30,710 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2021-12-14 13:44:30,710 INFO L858 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2021-12-14 13:44:30,710 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2021-12-14 13:44:30,710 INFO L854 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-12-14 13:44:30,710 INFO L858 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2021-12-14 13:44:30,710 INFO L858 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2021-12-14 13:44:30,715 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2021-12-14 13:44:30,716 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 13:44:30,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,725 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,725 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,726 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,726 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,726 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,726 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,733 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,733 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_920,QUANTIFIED] [2021-12-14 13:44:30,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,764 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_920,QUANTIFIED] [2021-12-14 13:44:30,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,770 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_477,QUANTIFIED] [2021-12-14 13:44:30,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,770 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_477,QUANTIFIED] [2021-12-14 13:44:30,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_477,QUANTIFIED] [2021-12-14 13:44:30,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_477,QUANTIFIED] [2021-12-14 13:44:30,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,777 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-14 13:44:30,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,778 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_916,QUANTIFIED] [2021-12-14 13:44:30,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-14 13:44:30,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,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-14 13:44:30,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_916,QUANTIFIED] [2021-12-14 13:44:30,782 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-14 13:44:30,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,788 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,788 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,788 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,788 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:44:30 BoogieIcfgContainer [2021-12-14 13:44:30,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 13:44:30,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 13:44:30,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 13:44:30,792 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 13:44:30,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:43:15" (3/4) ... [2021-12-14 13:44:30,795 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-14 13:44:30,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2021-12-14 13:44:30,804 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-12-14 13:44:30,805 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-14 13:44:30,805 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-14 13:44:30,805 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-14 13:44:30,828 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((last == #memory_$Pointer$[head][head] && \result == 0) && head == 0) && #memory_$Pointer$[\result][\result] == 0) && len <= 1) && len == 2) && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 : int :: v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 < \result || (forall v_ArrVal_916 : int :: !(\result == #memory_$Pointer$[\result][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 + 4 := v_ArrVal_916][\result])))) && !(head == #memory_$Pointer$[head][head]) [2021-12-14 13:44:30,829 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1 && #memory_$Pointer$[s][s] == 0) && index <= 0) && len <= 1) && 2 <= i) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && s == 0) || (((((((i == 1 && #memory_$Pointer$[s][s] == 0) && index <= 0) && (forall v_ArrVal_477 : [int]int :: unknown-#memory_int-unknown[#memory_$Pointer$[s][s] := v_ArrVal_477][s][s + 4] <= len)) && len <= 1) && len == 2) && s == 0) && (forall v_ArrVal_477 : [int]int :: len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s] := v_ArrVal_477][s][s + 4]))) || ((((((((((last == #memory_$Pointer$[head][head] && i == 0) && \result == 0) && head == 0) && !(#memory_$Pointer$[s][s] == s)) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && len <= 1) && len == 2) && !(head == #memory_$Pointer$[head][head])) && s == 0) [2021-12-14 13:44:30,830 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((#memory_$Pointer$[s][s] == 0 && len + 1 == data) && len + i == data) && index <= 0) && len <= 1) && (forall v_ArrVal_920 : [int]int :: #memory_$Pointer$[head := v_ArrVal_920][s][s] == head)) && len == 2) && #memory_$Pointer$[s][s] == head) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && s == 0) || ((((((((((((((last == #memory_$Pointer$[head][head] && \result == 0) && head == s) && head == 0) && !(head == #memory_$Pointer$[head][s])) && s == head) && !(#memory_$Pointer$[\result][\result] == \result)) && len + i == data) && index <= 0) && len <= 1) && len == data) && len == 2) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][s] == 0) && s == 0)) || (((((((((((#memory_$Pointer$[head][head] == 0 && head == s) && !(#memory_$Pointer$[head][head] == s)) && index <= 1) && s == head) && 1 <= index) && len + 1 == data) && len + i == data) && len <= 1) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && s == 0) [2021-12-14 13:44:30,831 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((len + i == unknown-#memory_int-unknown[s][4] && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && #memory_$Pointer$[s][s] == 0) && 2 == expected) && \result == expected) && index <= 0) && len <= 1) && index == 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && unknown-#memory_int-unknown[head][head + 4] == expected) && s == 0) || ((((((((((((0 <= s && expected <= unknown-#memory_int-unknown[head][head + 4]) && !(#memory_$Pointer$[s][s] == s)) && i == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && expected <= \result) && #memory_$Pointer$[s][s] == 0) && \result <= expected) && head == 0) && len == 2) && index < 1) && unknown-#memory_int-unknown[head][head + 4] <= expected) && s <= 0) [2021-12-14 13:44:30,848 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 13:44:30,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 13:44:30,849 INFO L158 Benchmark]: Toolchain (without parser) took 75835.51ms. Allocated memory was 144.7MB in the beginning and 302.0MB in the end (delta: 157.3MB). Free memory was 115.8MB in the beginning and 241.4MB in the end (delta: -125.6MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2021-12-14 13:44:30,850 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 41.8MB in the beginning and 41.8MB in the end (delta: 40.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:44:30,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.51ms. Allocated memory is still 144.7MB. Free memory was 115.4MB in the beginning and 115.3MB in the end (delta: 172.4kB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2021-12-14 13:44:30,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.65ms. Allocated memory is still 144.7MB. Free memory was 115.3MB in the beginning and 113.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:44:30,851 INFO L158 Benchmark]: Boogie Preprocessor took 41.76ms. Allocated memory is still 144.7MB. Free memory was 113.2MB in the beginning and 111.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:44:30,851 INFO L158 Benchmark]: RCFGBuilder took 338.26ms. Allocated memory is still 144.7MB. Free memory was 111.5MB in the beginning and 98.1MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-14 13:44:30,851 INFO L158 Benchmark]: TraceAbstraction took 74977.87ms. Allocated memory was 144.7MB in the beginning and 302.0MB in the end (delta: 157.3MB). Free memory was 97.6MB in the beginning and 245.6MB in the end (delta: -148.0MB). Peak memory consumption was 125.0MB. Max. memory is 16.1GB. [2021-12-14 13:44:30,851 INFO L158 Benchmark]: Witness Printer took 57.13ms. Allocated memory is still 302.0MB. Free memory was 245.6MB in the beginning and 241.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 13:44:30,856 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.17ms. Allocated memory is still 81.8MB. Free memory was 41.8MB in the beginning and 41.8MB in the end (delta: 40.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.51ms. Allocated memory is still 144.7MB. Free memory was 115.4MB in the beginning and 115.3MB in the end (delta: 172.4kB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.65ms. Allocated memory is still 144.7MB. Free memory was 115.3MB in the beginning and 113.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.76ms. Allocated memory is still 144.7MB. Free memory was 113.2MB in the beginning and 111.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 338.26ms. Allocated memory is still 144.7MB. Free memory was 111.5MB in the beginning and 98.1MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 74977.87ms. Allocated memory was 144.7MB in the beginning and 302.0MB in the end (delta: 157.3MB). Free memory was 97.6MB in the beginning and 245.6MB in the end (delta: -148.0MB). Peak memory consumption was 125.0MB. Max. memory is 16.1GB. * Witness Printer took 57.13ms. Allocated memory is still 302.0MB. Free memory was 245.6MB in the beginning and 241.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_920,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_920,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_477,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_477,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_477,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_477,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation 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_916,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 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_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_916,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 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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: 74.9s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 57.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 677 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 674 mSDsluCounter, 2441 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 713 IncrementalHoareTripleChecker+Unchecked, 2056 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2073 IncrementalHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 385 mSDtfsCounter, 2073 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 907 GetRequests, 664 SyntacticMatches, 20 SemanticMatches, 223 ConstructedPredicates, 11 IntricatePredicates, 1 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=10, InterpolantAutomatonStates: 118, 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, 117 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 18 PreInvPairs, 38 NumberOfFragments, 1034 HoareAnnotationTreeSize, 18 FomulaSimplifications, 7748 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 14 FomulaSimplificationsInter, 5953 FormulaSimplificationTreeSizeReductionInter, 57.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 870 NumberOfCodeBlocks, 867 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1174 ConstructedInterpolants, 22 QuantifiedInterpolants, 5861 SizeOfPredicates, 92 NumberOfNonLiveVariables, 2882 ConjunctsInSsa, 236 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 396/548 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-14 13:44:30,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((len + i == unknown-#memory_int-unknown[s][4] && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && #memory_$Pointer$[s][s] == 0) && 2 == expected) && \result == expected) && index <= 0) && len <= 1) && index == 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && unknown-#memory_int-unknown[head][head + 4] == expected) && s == 0) || ((((((((((((0 <= s && expected <= unknown-#memory_int-unknown[head][head + 4]) && !(#memory_$Pointer$[s][s] == s)) && i == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && expected <= \result) && #memory_$Pointer$[s][s] == 0) && \result <= expected) && head == 0) && len == 2) && index < 1) && unknown-#memory_int-unknown[head][head + 4] <= expected) && s <= 0) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2021-12-14 13:44:30,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((last == #memory_$Pointer$[head][head] && head == 0) && len <= 1) && len == 2) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][head] == 0) || ((((2 == len && head == 0) && head == last) && len == 2) && \valid[last] == 1) - InvariantResult [Line: 629]: Loop Invariant [2021-12-14 13:44:30,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((len + i == unknown-#memory_int-unknown[s][4] && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && #memory_$Pointer$[s][s] == 0) && index <= 0) && len <= 1) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && s == 0) || ((2 <= i && len == 2) && index < 1)) || (((((((((0 <= s && index <= 0) && 1 <= i) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && #memory_$Pointer$[s][s] == 0) && len <= 1) && len == 2) && index < 1) && s <= 0) - InvariantResult [Line: 614]: Loop Invariant [2021-12-14 13:44:30,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_920,QUANTIFIED] [2021-12-14 13:44:30,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,891 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,891 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,891 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,891 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_920,QUANTIFIED] [2021-12-14 13:44:30,892 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,892 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,892 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,892 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,892 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,892 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,892 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((#memory_$Pointer$[s][s] == 0 && len + 1 == data) && len + i == data) && index <= 0) && len <= 1) && (forall v_ArrVal_920 : [int]int :: #memory_$Pointer$[head := v_ArrVal_920][s][s] == head)) && len == 2) && #memory_$Pointer$[s][s] == head) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && s == 0) || ((((((((((((((last == #memory_$Pointer$[head][head] && \result == 0) && head == s) && head == 0) && !(head == #memory_$Pointer$[head][s])) && s == head) && !(#memory_$Pointer$[\result][\result] == \result)) && len + i == data) && index <= 0) && len <= 1) && len == data) && len == 2) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][s] == 0) && s == 0)) || (((((((((((#memory_$Pointer$[head][head] == 0 && head == s) && !(#memory_$Pointer$[head][head] == s)) && index <= 1) && s == head) && 1 <= index) && len + 1 == data) && len + i == data) && len <= 1) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && s == 0) - InvariantResult [Line: 625]: Loop Invariant [2021-12-14 13:44:30,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,894 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,894 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_477,QUANTIFIED] [2021-12-14 13:44:30,894 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_477,QUANTIFIED] [2021-12-14 13:44:30,894 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,895 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,895 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,895 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,895 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,895 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_477,QUANTIFIED] [2021-12-14 13:44:30,897 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,898 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_477,QUANTIFIED] [2021-12-14 13:44:30,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1 && #memory_$Pointer$[s][s] == 0) && index <= 0) && len <= 1) && 2 <= i) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && s == 0) || (((((((i == 1 && #memory_$Pointer$[s][s] == 0) && index <= 0) && (forall v_ArrVal_477 : [int]int :: unknown-#memory_int-unknown[#memory_$Pointer$[s][s] := v_ArrVal_477][s][s + 4] <= len)) && len <= 1) && len == 2) && s == 0) && (forall v_ArrVal_477 : [int]int :: len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s] := v_ArrVal_477][s][s + 4]))) || ((((((((((last == #memory_$Pointer$[head][head] && i == 0) && \result == 0) && head == 0) && !(#memory_$Pointer$[s][s] == s)) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && len <= 1) && len == 2) && !(head == #memory_$Pointer$[head][head])) && s == 0) - InvariantResult [Line: 583]: Loop Invariant [2021-12-14 13:44:30,900 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,900 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,900 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-14 13:44:30,900 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_916,QUANTIFIED] [2021-12-14 13:44:30,900 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-14 13:44:30,900 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,901 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-14 13:44:30,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_916,QUANTIFIED] [2021-12-14 13:44:30,902 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-14 13:44:30,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((last == #memory_$Pointer$[head][head] && \result == 0) && head == 0) && #memory_$Pointer$[\result][\result] == 0) && len <= 1) && len == 2) && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 : int :: v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 < \result || (forall v_ArrVal_916 : int :: !(\result == #memory_$Pointer$[\result][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20 + 4 := v_ArrVal_916][\result])))) && !(head == #memory_$Pointer$[head][head]) - InvariantResult [Line: 607]: Loop Invariant [2021-12-14 13:44:30,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,905 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,905 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,905 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,906 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,906 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-14 13:44:30,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 13:44:30,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((len + i == unknown-#memory_int-unknown[s][4] && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && #memory_$Pointer$[s][s] == 0) && 2 == expected) && index <= 0) && len <= 1) && index == 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && unknown-#memory_int-unknown[head][head + 4] == expected) && s == 0) || ((((((((((((0 <= s && index <= 0) && expected <= unknown-#memory_int-unknown[head][head + 4]) && !(#memory_$Pointer$[s][s] == s)) && i == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && #memory_$Pointer$[s][s] == 0) && len <= 1) && head == 0) && len == 2) && index < 1) && unknown-#memory_int-unknown[head][head + 4] <= expected) && s <= 0)) || ((((((((((((((((0 <= s && head <= 0) && #memory_$Pointer$[head][head] == 0) && !(head == #memory_$Pointer$[head][head])) && !(#memory_$Pointer$[s][s] == s)) && i == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && 0 <= head) && 1 <= index) && #memory_$Pointer$[s][s] == 0) && len <= 1) && index <= 1) && len == 2) && index < 1) && s <= 0) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4] <= expected) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4]) RESULT: Ultimate proved your program to be correct! [2021-12-14 13:44:30,919 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