./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/sll2n_update_all_reverse.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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:37:07,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:37:07,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:37:07,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:37:07,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:37:07,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:37:07,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:37:07,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:37:07,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:37:07,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:37:07,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:37:07,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:37:07,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:37:07,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:37:07,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:37:07,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:37:07,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:37:07,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:37:07,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:37:07,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:37:07,933 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:37:07,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:37:07,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:37:07,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:37:07,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:37:07,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:37:07,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:37:07,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:37:07,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:37:07,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:37:07,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:37:07,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:37:07,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:37:07,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:37:07,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:37:07,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:37:07,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:37:07,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:37:07,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:37:07,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:37:07,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:37:07,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:37:07,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:37:07,978 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:37:07,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:37:07,979 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:37:07,979 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:37:07,980 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:37:07,980 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:37:07,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:37:07,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:37:07,981 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:37:07,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:37:07,982 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:37:07,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:37:07,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:37:07,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:37:07,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:37:07,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:37:07,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:37:07,983 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:37:07,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:37:07,983 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:37:07,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:37:07,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:37:07,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:37:07,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:37:07,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:37:07,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:37:07,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:37:07,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:37:07,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:37:07,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:37:07,986 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:37:07,986 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:37:07,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:37:07,986 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2022-07-12 03:37:08,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:37:08,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:37:08,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:37:08,212 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:37:08,212 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:37:08,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-07-12 03:37:08,257 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/151c3aba8/d267fa3d02764b949328407216a39049/FLAG2014c10bf [2022-07-12 03:37:08,710 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:37:08,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-07-12 03:37:08,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/151c3aba8/d267fa3d02764b949328407216a39049/FLAG2014c10bf [2022-07-12 03:37:09,233 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/151c3aba8/d267fa3d02764b949328407216a39049 [2022-07-12 03:37:09,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:37:09,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:37:09,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:37:09,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:37:09,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:37:09,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:37:09" (1/1) ... [2022-07-12 03:37:09,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b72aa24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:09, skipping insertion in model container [2022-07-12 03:37:09,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:37:09" (1/1) ... [2022-07-12 03:37:09,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:37:09,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:37:09,504 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/sll2n_update_all_reverse.i[24236,24249] [2022-07-12 03:37:09,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:37:09,517 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:37:09,544 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/sll2n_update_all_reverse.i[24236,24249] [2022-07-12 03:37:09,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:37:09,569 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:37:09,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:09 WrapperNode [2022-07-12 03:37:09,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:37:09,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:37:09,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:37:09,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:37:09,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:09" (1/1) ... [2022-07-12 03:37:09,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:09" (1/1) ... [2022-07-12 03:37:09,634 INFO L137 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2022-07-12 03:37:09,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:37:09,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:37:09,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:37:09,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:37:09,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:09" (1/1) ... [2022-07-12 03:37:09,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:09" (1/1) ... [2022-07-12 03:37:09,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:09" (1/1) ... [2022-07-12 03:37:09,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:09" (1/1) ... [2022-07-12 03:37:09,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:09" (1/1) ... [2022-07-12 03:37:09,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:09" (1/1) ... [2022-07-12 03:37:09,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:09" (1/1) ... [2022-07-12 03:37:09,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:37:09,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:37:09,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:37:09,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:37:09,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:09" (1/1) ... [2022-07-12 03:37:09,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:37:09,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:09,709 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) [2022-07-12 03:37:09,717 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 [2022-07-12 03:37:09,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:37:09,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:37:09,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:37:09,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:37:09,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:37:09,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:37:09,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:37:09,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:37:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:37:09,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:37:09,823 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:37:09,825 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:37:10,016 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:37:10,021 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:37:10,021 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 03:37:10,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:37:10 BoogieIcfgContainer [2022-07-12 03:37:10,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:37:10,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:37:10,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:37:10,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:37:10,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:37:09" (1/3) ... [2022-07-12 03:37:10,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f55eac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:37:10, skipping insertion in model container [2022-07-12 03:37:10,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:09" (2/3) ... [2022-07-12 03:37:10,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f55eac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:37:10, skipping insertion in model container [2022-07-12 03:37:10,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:37:10" (3/3) ... [2022-07-12 03:37:10,041 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-07-12 03:37:10,054 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:37:10,055 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:37:10,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:37:10,105 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5cf620bc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6cb26de7 [2022-07-12 03:37:10,106 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:37:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:37:10,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:10,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:10,130 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:10,134 INFO L85 PathProgramCache]: Analyzing trace with hash -204150994, now seen corresponding path program 1 times [2022-07-12 03:37:10,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:10,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283031899] [2022-07-12 03:37:10,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:10,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:10,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:10,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283031899] [2022-07-12 03:37:10,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283031899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:37:10,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:37:10,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:37:10,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089791106] [2022-07-12 03:37:10,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:37:10,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:37:10,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:10,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:37:10,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:37:10,288 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:10,304 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2022-07-12 03:37:10,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:37:10,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2022-07-12 03:37:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:10,311 INFO L225 Difference]: With dead ends: 52 [2022-07-12 03:37:10,312 INFO L226 Difference]: Without dead ends: 23 [2022-07-12 03:37:10,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:37:10,318 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:10,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-12 03:37:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-12 03:37:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-12 03:37:10,341 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-07-12 03:37:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:10,341 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-12 03:37:10,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-12 03:37:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:37:10,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:10,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:10,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:37:10,343 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:10,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1517700322, now seen corresponding path program 1 times [2022-07-12 03:37:10,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:10,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047620408] [2022-07-12 03:37:10,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:10,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:10,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:10,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047620408] [2022-07-12 03:37:10,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047620408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:37:10,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:37:10,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:37:10,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139974155] [2022-07-12 03:37:10,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:37:10,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:37:10,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:10,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:37:10,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:37:10,391 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:10,408 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-07-12 03:37:10,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:37:10,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2022-07-12 03:37:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:10,409 INFO L225 Difference]: With dead ends: 44 [2022-07-12 03:37:10,410 INFO L226 Difference]: Without dead ends: 28 [2022-07-12 03:37:10,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:37:10,416 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:10,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-12 03:37:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-12 03:37:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-12 03:37:10,428 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 13 [2022-07-12 03:37:10,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:10,428 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-12 03:37:10,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:10,429 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-12 03:37:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:37:10,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:10,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:10,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:37:10,430 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:10,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:10,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1110902602, now seen corresponding path program 1 times [2022-07-12 03:37:10,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:10,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386791165] [2022-07-12 03:37:10,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:10,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:10,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:10,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386791165] [2022-07-12 03:37:10,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386791165] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:37:10,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318401097] [2022-07-12 03:37:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:10,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:10,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:10,510 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) [2022-07-12 03:37:10,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:37:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:10,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:37:10,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:37:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:10,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:37:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:10,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318401097] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:37:10,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:37:10,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-12 03:37:10,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274976259] [2022-07-12 03:37:10,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:37:10,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:37:10,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:10,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:37:10,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:37:10,696 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:10,718 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-12 03:37:10,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:37:10,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 18 [2022-07-12 03:37:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:10,720 INFO L225 Difference]: With dead ends: 45 [2022-07-12 03:37:10,720 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 03:37:10,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:37:10,721 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:10,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 03:37:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-12 03:37:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-07-12 03:37:10,731 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2022-07-12 03:37:10,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:10,731 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-12 03:37:10,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-07-12 03:37:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:37:10,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:10,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:10,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:37:10,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:10,947 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:10,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:10,947 INFO L85 PathProgramCache]: Analyzing trace with hash 266893854, now seen corresponding path program 2 times [2022-07-12 03:37:10,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:10,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806040960] [2022-07-12 03:37:10,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:10,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 03:37:11,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:11,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806040960] [2022-07-12 03:37:11,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806040960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:37:11,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:37:11,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:37:11,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128454871] [2022-07-12 03:37:11,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:37:11,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:37:11,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:11,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:37:11,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:37:11,066 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:11,108 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-07-12 03:37:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:37:11,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 23 [2022-07-12 03:37:11,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:11,110 INFO L225 Difference]: With dead ends: 51 [2022-07-12 03:37:11,111 INFO L226 Difference]: Without dead ends: 42 [2022-07-12 03:37:11,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:37:11,113 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:11,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 41 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-12 03:37:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-07-12 03:37:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-12 03:37:11,121 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2022-07-12 03:37:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:11,121 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-12 03:37:11,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-12 03:37:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:37:11,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:11,122 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:11,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:37:11,122 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:11,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:11,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1444962716, now seen corresponding path program 1 times [2022-07-12 03:37:11,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:11,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702440608] [2022-07-12 03:37:11,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:11,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 03:37:11,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:11,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702440608] [2022-07-12 03:37:11,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702440608] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:37:11,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773157996] [2022-07-12 03:37:11,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:11,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:11,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:11,264 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) [2022-07-12 03:37:11,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:37:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:11,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:37:11,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:37:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 03:37:11,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:37:11,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773157996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:37:11,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 03:37:11,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-07-12 03:37:11,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20360776] [2022-07-12 03:37:11,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:37:11,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:37:11,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:11,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:37:11,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:37:11,379 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:11,408 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-07-12 03:37:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:37:11,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) Word has length 28 [2022-07-12 03:37:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:11,409 INFO L225 Difference]: With dead ends: 57 [2022-07-12 03:37:11,409 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 03:37:11,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:37:11,410 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:11,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 59 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:11,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 03:37:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-07-12 03:37:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-07-12 03:37:11,414 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 28 [2022-07-12 03:37:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:11,414 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-07-12 03:37:11,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-07-12 03:37:11,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:37:11,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:11,417 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:11,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 03:37:11,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:11,634 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:11,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:11,635 INFO L85 PathProgramCache]: Analyzing trace with hash 46899759, now seen corresponding path program 1 times [2022-07-12 03:37:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:11,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916620977] [2022-07-12 03:37:11,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:11,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 03:37:11,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:11,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916620977] [2022-07-12 03:37:11,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916620977] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:37:11,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994087994] [2022-07-12 03:37:11,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:11,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:11,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:11,705 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) [2022-07-12 03:37:11,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 03:37:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:11,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 03:37:11,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:37:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 03:37:11,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:37:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 03:37:11,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994087994] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:37:11,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:37:11,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-12 03:37:11,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354306642] [2022-07-12 03:37:11,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:37:11,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 03:37:11,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:11,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 03:37:11,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:37:11,861 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:11,884 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-07-12 03:37:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:37:11,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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) Word has length 29 [2022-07-12 03:37:11,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:11,885 INFO L225 Difference]: With dead ends: 54 [2022-07-12 03:37:11,885 INFO L226 Difference]: Without dead ends: 45 [2022-07-12 03:37:11,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:37:11,886 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:11,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-12 03:37:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-07-12 03:37:11,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-07-12 03:37:11,890 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 29 [2022-07-12 03:37:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:11,891 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-12 03:37:11,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-07-12 03:37:11,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 03:37:11,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:11,891 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:11,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:37:12,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:12,092 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:12,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:12,093 INFO L85 PathProgramCache]: Analyzing trace with hash 402168875, now seen corresponding path program 2 times [2022-07-12 03:37:12,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:12,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791669233] [2022-07-12 03:37:12,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:12,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 03:37:12,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:12,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791669233] [2022-07-12 03:37:12,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791669233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:37:12,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:37:12,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:37:12,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791380541] [2022-07-12 03:37:12,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:37:12,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:37:12,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:12,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:37:12,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:37:12,159 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:12,180 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-07-12 03:37:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:37:12,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 34 [2022-07-12 03:37:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:12,181 INFO L225 Difference]: With dead ends: 53 [2022-07-12 03:37:12,181 INFO L226 Difference]: Without dead ends: 45 [2022-07-12 03:37:12,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:37:12,182 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:12,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 58 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:12,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-12 03:37:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-07-12 03:37:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-07-12 03:37:12,186 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 34 [2022-07-12 03:37:12,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:12,186 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-07-12 03:37:12,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:12,187 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-07-12 03:37:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 03:37:12,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:12,187 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:12,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 03:37:12,187 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:12,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash -366012659, now seen corresponding path program 1 times [2022-07-12 03:37:12,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:12,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081817487] [2022-07-12 03:37:12,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:12,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:12,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:12,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081817487] [2022-07-12 03:37:12,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081817487] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:37:12,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3120585] [2022-07-12 03:37:12,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:12,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:12,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:12,712 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) [2022-07-12 03:37:12,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 03:37:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:12,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-12 03:37:12,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:37:12,839 INFO L390 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 [2022-07-12 03:37:12,867 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:37:12,867 INFO L390 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 [2022-07-12 03:37:12,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:37:12,887 INFO L390 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 13 treesize of output 9 [2022-07-12 03:37:13,062 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:37:13,062 INFO L390 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 66 treesize of output 63 [2022-07-12 03:37:13,067 INFO L390 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 33 treesize of output 23 [2022-07-12 03:37:13,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:13,070 INFO L390 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 36 treesize of output 38 [2022-07-12 03:37:13,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:37:13,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:13,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-07-12 03:37:13,204 INFO L390 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 [2022-07-12 03:37:13,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:13,211 INFO L390 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 35 treesize of output 34 [2022-07-12 03:37:13,360 INFO L390 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 42 treesize of output 30 [2022-07-12 03:37:13,364 INFO L390 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 30 treesize of output 22 [2022-07-12 03:37:13,416 INFO L390 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 26 treesize of output 18 [2022-07-12 03:37:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:37:13,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:37:13,600 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_397 Int) (v_ArrVal_393 Int) (v_ArrVal_396 (Array Int Int))) (<= (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_396) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_393)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_397)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (forall ((v_ArrVal_397 Int) (v_ArrVal_393 Int) (v_ArrVal_396 (Array Int Int))) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_396) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_393)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_397)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1)))) is different from false [2022-07-12 03:37:13,662 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (forall ((v_ArrVal_397 Int) (v_ArrVal_393 Int) (v_ArrVal_396 (Array Int Int))) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_396) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse0)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) .cse0))) 1))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_397 Int) (v_ArrVal_393 Int) (v_ArrVal_396 (Array Int Int))) (<= (+ (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_396) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse1)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) .cse1))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|)))) is different from false [2022-07-12 03:37:13,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:13,751 INFO L390 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 46 treesize of output 47 [2022-07-12 03:37:13,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:13,762 INFO L390 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 98 treesize of output 101 [2022-07-12 03:37:13,769 INFO L390 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 37 treesize of output 23 [2022-07-12 03:37:13,819 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:13,819 INFO L390 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 46 treesize of output 47 [2022-07-12 03:37:13,828 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:13,829 INFO L390 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 98 treesize of output 101 [2022-07-12 03:37:13,845 INFO L390 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 37 treesize of output 23 [2022-07-12 03:37:13,895 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_397 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (<= .cse1 .cse0))) is different from false [2022-07-12 03:37:13,952 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_397 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) v_ArrVal_391) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_390) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_390) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))))) is different from false [2022-07-12 03:37:14,001 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_397 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_391) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_390) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse3))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) v_ArrVal_390) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse1))) is different from false [2022-07-12 03:37:14,060 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0) v_ArrVal_390) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse0))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_390) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse2) .cse1)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_397 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) v_ArrVal_391) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|)))) is different from false [2022-07-12 03:37:14,091 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_390) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse1))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) v_ArrVal_390) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_397 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_391) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) .cse3)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|)))) is different from false [2022-07-12 03:37:14,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:37:14,143 INFO L390 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 15 treesize of output 11 [2022-07-12 03:37:14,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:37:14,146 INFO L390 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 16 treesize of output 12 [2022-07-12 03:37:14,151 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:37:14,152 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-07-12 03:37:14,156 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:37:14,157 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-07-12 03:37:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-12 03:37:14,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3120585] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:37:14,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:37:14,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 46 [2022-07-12 03:37:14,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236671069] [2022-07-12 03:37:14,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:37:14,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 03:37:14,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:14,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 03:37:14,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1378, Unknown=7, NotChecked=560, Total=2070 [2022-07-12 03:37:14,295 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 46 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 46 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:15,139 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_390) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse1))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) v_ArrVal_390) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_397 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_391) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) .cse3)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|)))) is different from false [2022-07-12 03:37:15,635 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_390) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse1))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) v_ArrVal_390) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_397 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_391) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) .cse3)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|)))) is different from false [2022-07-12 03:37:16,192 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_390) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse1))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) v_ArrVal_390) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_397 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_391) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) .cse3)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|)))) is different from false [2022-07-12 03:37:33,014 WARN L233 SmtUtils]: Spent 16.74s on a formula simplification. DAG size of input: 59 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:37:35,076 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse4 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse5 (+ |c_ULTIMATE.start_main_~len~0#1| (- 1)))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse1 4))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_397 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (<= .cse3 .cse4) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select .cse1 .cse2)) (= (+ (* |c_ULTIMATE.start_main_~len~0#1| (- 1)) |c_ULTIMATE.start_sll_update_at_~data#1|) .cse5) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (<= .cse4 .cse3) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (= |c_ULTIMATE.start_main_~i~0#1| .cse5))) is different from false [2022-07-12 03:37:35,662 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse4 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse1 4))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_397 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (<= .cse3 .cse4) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select .cse1 .cse2)) (= (+ (* |c_ULTIMATE.start_main_~len~0#1| (- 1)) |c_ULTIMATE.start_sll_update_at_~data#1|) (+ |c_ULTIMATE.start_main_~len~0#1| (- 1))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (<= .cse4 .cse3) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2022-07-12 03:37:35,667 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse4 (select .cse1 .cse6))) (let ((.cse2 (select (select |c_#memory_int| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse6))) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse1 4))) (= .cse2 (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= .cse2 (+ (- 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (forall ((v_ArrVal_397 Int) (v_ArrVal_393 Int) (v_ArrVal_396 (Array Int Int))) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_396) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse3)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) .cse3))) 1))))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_397 Int) (v_ArrVal_393 Int) (v_ArrVal_396 (Array Int Int))) (<= (+ (let ((.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_396) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse5)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) .cse5))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))))) is different from false [2022-07-12 03:37:35,675 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse0 4))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |c_#memory_int| (select .cse0 .cse1)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (+ (- 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (forall ((v_ArrVal_397 Int) (v_ArrVal_393 Int) (v_ArrVal_396 (Array Int Int))) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_396) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse2)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) .cse2))) 1))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_397 Int) (v_ArrVal_393 Int) (v_ArrVal_396 (Array Int Int))) (<= (+ (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_396) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse3)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_397) .cse3))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))))) is different from false [2022-07-12 03:37:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:35,973 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-07-12 03:37:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 03:37:35,974 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 46 states have internal predecessors, (82), 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) Word has length 35 [2022-07-12 03:37:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:35,974 INFO L225 Difference]: With dead ends: 78 [2022-07-12 03:37:35,974 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 03:37:35,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=284, Invalid=2410, Unknown=14, NotChecked=1582, Total=4290 [2022-07-12 03:37:35,976 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:35,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 182 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 465 Invalid, 0 Unknown, 245 Unchecked, 0.2s Time] [2022-07-12 03:37:35,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 03:37:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2022-07-12 03:37:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-07-12 03:37:35,983 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 35 [2022-07-12 03:37:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:35,983 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-07-12 03:37:35,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 46 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-07-12 03:37:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:37:35,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:35,984 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 03:37:36,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:37:36,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:36,205 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:36,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:36,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1590163563, now seen corresponding path program 2 times [2022-07-12 03:37:36,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:36,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018188753] [2022-07-12 03:37:36,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:36,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 03:37:36,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:36,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018188753] [2022-07-12 03:37:36,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018188753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:37:36,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:37:36,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:37:36,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925594143] [2022-07-12 03:37:36,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:37:36,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:37:36,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:36,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:37:36,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:37:36,287 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:36,327 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-07-12 03:37:36,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:37:36,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) Word has length 36 [2022-07-12 03:37:36,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:36,329 INFO L225 Difference]: With dead ends: 64 [2022-07-12 03:37:36,329 INFO L226 Difference]: Without dead ends: 56 [2022-07-12 03:37:36,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:37:36,330 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:36,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 52 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-12 03:37:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-12 03:37:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-07-12 03:37:36,351 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 36 [2022-07-12 03:37:36,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:36,353 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-07-12 03:37:36,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:36,353 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-07-12 03:37:36,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:37:36,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:36,354 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 03:37:36,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 03:37:36,354 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:36,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:36,355 INFO L85 PathProgramCache]: Analyzing trace with hash 108045400, now seen corresponding path program 3 times [2022-07-12 03:37:36,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:36,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709771910] [2022-07-12 03:37:36,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:36,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 03:37:36,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:36,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709771910] [2022-07-12 03:37:36,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709771910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:37:36,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:37:36,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:37:36,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586719088] [2022-07-12 03:37:36,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:37:36,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:37:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:36,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:37:36,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:37:36,423 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:36,443 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2022-07-12 03:37:36,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:37:36,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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) Word has length 36 [2022-07-12 03:37:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:36,444 INFO L225 Difference]: With dead ends: 80 [2022-07-12 03:37:36,444 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 03:37:36,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:37:36,445 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 39 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:36,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 62 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 03:37:36,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2022-07-12 03:37:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-07-12 03:37:36,458 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 36 [2022-07-12 03:37:36,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:36,458 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-07-12 03:37:36,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-07-12 03:37:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:37:36,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:36,461 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 03:37:36,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 03:37:36,462 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:36,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:36,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1465345254, now seen corresponding path program 4 times [2022-07-12 03:37:36,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:36,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180592589] [2022-07-12 03:37:36,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:36,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 03:37:36,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:36,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180592589] [2022-07-12 03:37:36,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180592589] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:37:36,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22362192] [2022-07-12 03:37:36,541 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 03:37:36,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:36,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:36,556 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) [2022-07-12 03:37:36,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 03:37:36,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 03:37:36,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:37:36,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:37:36,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:37:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 03:37:36,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:37:36,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22362192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:37:36,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 03:37:36,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-12 03:37:36,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373592409] [2022-07-12 03:37:36,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:37:36,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:37:36,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:36,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:37:36,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:37:36,724 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:36,752 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-07-12 03:37:36,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:37:36,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) Word has length 36 [2022-07-12 03:37:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:36,752 INFO L225 Difference]: With dead ends: 65 [2022-07-12 03:37:36,753 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 03:37:36,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:37:36,753 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 54 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:36,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 36 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 03:37:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-12 03:37:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-07-12 03:37:36,759 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 36 [2022-07-12 03:37:36,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:36,759 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-07-12 03:37:36,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-07-12 03:37:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 03:37:36,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:36,759 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:36,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:37:36,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 03:37:36,960 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:36,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash -5958248, now seen corresponding path program 1 times [2022-07-12 03:37:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:36,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633624075] [2022-07-12 03:37:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 03:37:37,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:37,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633624075] [2022-07-12 03:37:37,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633624075] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:37:37,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161272387] [2022-07-12 03:37:37,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:37,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:37,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:37,152 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) [2022-07-12 03:37:37,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 03:37:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:37,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-12 03:37:37,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:37:37,350 INFO L390 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 15 treesize of output 11 [2022-07-12 03:37:37,456 INFO L390 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 15 treesize of output 7 [2022-07-12 03:37:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 03:37:37,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:37:37,582 INFO L390 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 36 treesize of output 32 [2022-07-12 03:37:37,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:37,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 03:37:37,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161272387] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:37:37,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:37:37,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 26 [2022-07-12 03:37:37,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793105306] [2022-07-12 03:37:37,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:37:37,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 03:37:37,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:37,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 03:37:37,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2022-07-12 03:37:37,654 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:37,968 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-07-12 03:37:37,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:37:37,968 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 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) Word has length 41 [2022-07-12 03:37:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:37,969 INFO L225 Difference]: With dead ends: 54 [2022-07-12 03:37:37,969 INFO L226 Difference]: Without dead ends: 52 [2022-07-12 03:37:37,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 62 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 03:37:37,970 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 101 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:37,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 281 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:37:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-12 03:37:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-07-12 03:37:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-07-12 03:37:37,978 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 41 [2022-07-12 03:37:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:37,978 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-07-12 03:37:37,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-07-12 03:37:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 03:37:37,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:37,979 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:38,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:37:38,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:38,183 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash -133051584, now seen corresponding path program 2 times [2022-07-12 03:37:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:38,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854689148] [2022-07-12 03:37:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 03:37:38,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:38,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854689148] [2022-07-12 03:37:38,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854689148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:37:38,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944177715] [2022-07-12 03:37:38,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:37:38,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:38,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:38,273 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) [2022-07-12 03:37:38,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 03:37:38,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:37:38,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:37:38,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:37:38,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:37:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 03:37:38,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:37:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 03:37:38,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944177715] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:37:38,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:37:38,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-07-12 03:37:38,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012144772] [2022-07-12 03:37:38,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:37:38,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 03:37:38,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:38,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 03:37:38,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:37:38,469 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:38,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:38,503 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-07-12 03:37:38,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:37:38,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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) Word has length 42 [2022-07-12 03:37:38,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:38,504 INFO L225 Difference]: With dead ends: 53 [2022-07-12 03:37:38,504 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:37:38,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-12 03:37:38,506 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 39 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:38,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 74 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:37:38,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:37:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:37:38,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2022-07-12 03:37:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:38,509 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:37:38,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:37:38,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:37:38,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:37:38,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 03:37:38,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:38,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:37:57,824 WARN L233 SmtUtils]: Spent 18.31s on a formula simplification. DAG size of input: 93 DAG size of output: 69 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-12 03:38:23,055 WARN L233 SmtUtils]: Spent 25.01s on a formula simplification. DAG size of input: 94 DAG size of output: 73 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-12 03:38:23,058 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-07-12 03:38:23,059 INFO L899 garLoopResultBuilder]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2022-07-12 03:38:23,059 INFO L895 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse9 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (* |ULTIMATE.start_main_~len~0#1| 2))) (let ((.cse3 (<= (+ .cse9 2) .cse1)) (.cse4 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse5 (= .cse1 (+ 2 |ULTIMATE.start_sll_update_at_~data#1|))) (.cse6 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse7 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse8 (<= |ULTIMATE.start_main_~len~0#1| .cse9))) (or (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (and (not (= |ULTIMATE.start_main_~s~0#1.base| (select .cse0 4))) (= .cse1 (+ (let ((.cse2 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |#memory_int| (select .cse0 .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse2))) 1)) .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse8)) (and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) .cse3 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) .cse4 .cse5 (= |ULTIMATE.start_main_~len~0#1| 2) .cse6 .cse7 .cse8)))) [2022-07-12 03:38:23,059 INFO L899 garLoopResultBuilder]: For program point L622-4(lines 622 627) no Hoare annotation was computed. [2022-07-12 03:38:23,059 INFO L895 garLoopResultBuilder]: At program point L581(lines 574 582) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse1 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1))) (or (and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 .cse1 (<= 1 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse2 .cse3) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3))) [2022-07-12 03:38:23,059 INFO L899 garLoopResultBuilder]: For program point L606(lines 606 612) no Hoare annotation was computed. [2022-07-12 03:38:23,059 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:38:23,059 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:38:23,059 INFO L902 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-07-12 03:38:23,059 INFO L895 garLoopResultBuilder]: At program point L590(lines 583 591) the Hoare annotation is: (and (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) |ULTIMATE.start_sll_create_#res#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2)) [2022-07-12 03:38:23,059 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse2 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse4 (= |ULTIMATE.start_sll_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (.cse6 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse7 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse2)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (and (not (= |ULTIMATE.start_main_~s~0#1.base| (select .cse0 4))) (= .cse1 (+ (select (select |#memory_int| (select .cse0 .cse2)) .cse3) 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse4 .cse5 .cse6 (= |ULTIMATE.start_sll_update_at_~index#1| |ULTIMATE.start_main_~i~0#1|) .cse7 .cse8)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |ULTIMATE.start_sll_update_at_~head#1.offset|)) |ULTIMATE.start_main_~s~0#1.base|)) .cse4 (<= |ULTIMATE.start_sll_update_at_~index#1| 1) (<= 1 |ULTIMATE.start_sll_update_at_~index#1|) .cse5 .cse6 .cse7 .cse9 .cse8) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_390) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))) (<= |ULTIMATE.start_sll_update_at_~index#1| 0) .cse5 (= .cse1 (+ |ULTIMATE.start_sll_update_at_~data#1| 1)) (= |ULTIMATE.start_sll_update_at_~head#1.offset| .cse3) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (not (= (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_390) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|))))) .cse9 .cse8)))) [2022-07-12 03:38:23,060 INFO L899 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2022-07-12 03:38:23,060 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2022-07-12 03:38:23,060 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse20 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse21 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0)) (.cse7 (not (= |ULTIMATE.start_main_~s~0#1.base| (select .cse21 4)))) (.cse8 (= .cse20 (+ (let ((.cse22 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |#memory_int| (select .cse21 .cse22)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse22))) 1))) (.cse12 (* 2 |ULTIMATE.start_main_~expected~0#1|)) (.cse10 (* 2 (div (+ (- 1) |ULTIMATE.start_main_~expected~0#1|) 2))) (.cse3 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse13 (<= (+ .cse1 2) .cse20)) (.cse4 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse14 (= .cse20 (+ 2 |ULTIMATE.start_sll_update_at_~data#1|))) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse6 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse15 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse16 (= (mod (+ |ULTIMATE.start_main_~expected~0#1| 1) 2) 0)) (.cse17 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse18 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse19 (<= |ULTIMATE.start_main_~len~0#1| .cse1))) (or (let ((.cse2 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (and .cse0 (= .cse1 .cse2) (= .cse3 |ULTIMATE.start_main_~expected~0#1|) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) .cse4 (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_sll_update_at_~data#1| .cse2) (<= |ULTIMATE.start_main_~expected~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) .cse5 .cse6 (<= 2 |ULTIMATE.start_main_~expected~0#1|))) (let ((.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|))) (and .cse7 .cse8 (<= 1 |ULTIMATE.start_sll_get_data_at_~index#1|) (not (= |ULTIMATE.start_sll_get_data_at_~head#1.base| (select .cse9 4))) (= (+ .cse10 (let ((.cse11 (+ |ULTIMATE.start_sll_get_data_at_~head#1.offset| 4))) (select (select |#memory_int| (select .cse9 .cse11)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse11))) 1) .cse12) .cse13 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 1) .cse4 .cse14 .cse5 .cse6 .cse15 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| 0) .cse16 .cse17 .cse18 .cse19)) (and .cse0 .cse7 .cse8 (= .cse12 (+ .cse10 .cse3 1)) .cse13 .cse4 .cse14 .cse5 .cse6 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2022-07-12 03:38:23,062 INFO L899 garLoopResultBuilder]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2022-07-12 03:38:23,062 INFO L895 garLoopResultBuilder]: At program point L625(lines 613 632) the Hoare annotation is: false [2022-07-12 03:38:23,062 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2022-07-12 03:38:23,062 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-07-12 03:38:23,062 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2022-07-12 03:38:23,062 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-07-12 03:38:23,062 INFO L899 garLoopResultBuilder]: For program point L618-2(lines 618 621) no Hoare annotation was computed. [2022-07-12 03:38:23,062 INFO L899 garLoopResultBuilder]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2022-07-12 03:38:23,062 INFO L895 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse7 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| (select .cse9 4)))) (.cse1 (= .cse7 (+ (let ((.cse10 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |#memory_int| (select .cse9 .cse10)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse10))) 1))) (.cse2 (+ 2 |ULTIMATE.start_main_~i~0#1|)) (.cse3 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~len~0#1| .cse2) .cse3 .cse4 .cse5) (let ((.cse6 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and .cse0 .cse1 (<= (+ .cse6 2) .cse7) (<= .cse2 |ULTIMATE.start_main_~len~0#1|) .cse3 (= .cse7 (+ 2 |ULTIMATE.start_sll_update_at_~data#1|)) .cse4 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse5 (<= |ULTIMATE.start_main_~len~0#1| .cse6))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 Int)) (not (= |ULTIMATE.start_main_~s~0#1.base| (let ((.cse8 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) .cse8) v_ArrVal_390) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_393) .cse8))))))) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) |ULTIMATE.start_sll_create_#res#1.base|)) .cse4 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse5)))) [2022-07-12 03:38:23,062 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse0 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0) (and (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) .cse1 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse0 (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)) (and .cse1 (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) .cse0))) [2022-07-12 03:38:23,063 INFO L899 garLoopResultBuilder]: For program point L618-4(lines 618 621) no Hoare annotation was computed. [2022-07-12 03:38:23,063 INFO L899 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2022-07-12 03:38:23,063 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:38:23,063 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-07-12 03:38:23,063 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:38:23,063 INFO L895 garLoopResultBuilder]: At program point L604(lines 599 605) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0)) (.cse7 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse6 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse8 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse10 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (or (let ((.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (* 2 |ULTIMATE.start_main_~expected~0#1|)) (.cse5 (* 2 (div (+ (- 1) |ULTIMATE.start_main_~expected~0#1|) 2))) (.cse2 (* |ULTIMATE.start_main_~len~0#1| 2))) (and .cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| (select .cse1 4))) (= .cse2 (+ (let ((.cse3 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |#memory_int| (select .cse1 .cse3)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse3))) 1)) (= .cse4 (+ .cse5 .cse6 1)) (<= (+ .cse7 2) .cse2) (= .cse4 (+ .cse5 |ULTIMATE.start_sll_get_data_at_#res#1| 1)) .cse8 (= .cse2 (+ 2 |ULTIMATE.start_sll_update_at_~data#1|)) .cse9 .cse10 (<= |ULTIMATE.start_main_~i~0#1| 1) (= (mod (+ |ULTIMATE.start_main_~expected~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| .cse7))) (let ((.cse11 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (and .cse0 (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) (= .cse7 .cse11) (= .cse6 |ULTIMATE.start_main_~expected~0#1|) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) .cse8 (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_sll_update_at_~data#1| .cse11) (<= |ULTIMATE.start_main_~expected~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) .cse9 .cse10 (<= 2 |ULTIMATE.start_main_~expected~0#1|))))) [2022-07-12 03:38:23,067 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1] [2022-07-12 03:38:23,068 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:38:23,077 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,079 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,079 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,084 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,084 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,094 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,096 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,096 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,097 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,101 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,102 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,107 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,112 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,113 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] [2022-07-12 03:38:23,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,113 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] [2022-07-12 03:38:23,113 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] [2022-07-12 03:38:23,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] [2022-07-12 03:38:23,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,129 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,129 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,129 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,133 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] [2022-07-12 03:38:23,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] [2022-07-12 03:38:23,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,137 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,137 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] [2022-07-12 03:38:23,137 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] [2022-07-12 03:38:23,137 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] [2022-07-12 03:38:23,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] [2022-07-12 03:38:23,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] [2022-07-12 03:38:23,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] [2022-07-12 03:38:23,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:38:23 BoogieIcfgContainer [2022-07-12 03:38:23,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:38:23,142 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:38:23,142 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:38:23,142 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:38:23,143 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:37:10" (3/4) ... [2022-07-12 03:38:23,145 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:38:23,153 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-07-12 03:38:23,153 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-12 03:38:23,153 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 03:38:23,154 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:38:23,171 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((2 == len && len == 2) || (((((\valid[temp] == 1 && \valid[head] == 1) && temp == 0) && 1 <= len) && len == 2) && \valid[\result] == 1)) || (((\valid[head] == 1 && !(head == #memory_$Pointer$[head][head + 4])) && head == 0) && len == 2) [2022-07-12 03:38:23,172 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && !(#memory_$Pointer$[\result][4] == \result)) && len == 2 [2022-07-12 03:38:23,172 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(s == #memory_$Pointer$[s][4]) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && len == 2 + i) && index <= 0) && len == 2) && s == 0) || ((((((((((!(s == #memory_$Pointer$[s][4]) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && unknown-#memory_int-unknown[s][s] + 2 <= len * 2) && 2 + i <= len) && index <= 0) && len * 2 == 2 + data) && len == 2) && s == head) && head == s) && s == 0) && len <= unknown-#memory_int-unknown[s][s])) || ((((((forall v_ULTIMATE.start_sll_update_at_~head#1.offset_9 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_9 || (forall v_ArrVal_390 : [int]int, v_ArrVal_393 : int :: !(s == #memory_$Pointer$[#memory_$Pointer$[s][s + 4] := v_ArrVal_390][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_9 := v_ArrVal_393][s + 4]))) && \result == 0) && !(#memory_$Pointer$[\result][4] == \result)) && len == 2) && len == i + 1) && s == 0) [2022-07-12 03:38:23,172 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(temp == head) && \valid[temp] == 1) && temp == 0) && 1 <= len) && \result == 0) && !(\result == head)) && len == 2) && \valid[\result] == 1) || ((((2 == len && \valid[temp] == 1) && temp == 0) && len == 2) && \valid[\result] == 1) [2022-07-12 03:38:23,173 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((index <= 0 && !(s == #memory_$Pointer$[s][4])) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && 2 * expected == 2 * ((-1 + expected) / 2) + unknown-#memory_int-unknown[head][head] + 1) && unknown-#memory_int-unknown[s][s] + 2 <= len * 2) && 2 * expected == 2 * ((-1 + expected) / 2) + \result + 1) && index <= 0) && len * 2 == 2 + data) && s == head) && head == s) && i <= 1) && (expected + 1) % 2 == 0) && len == i + 1) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) || ((((((((((((index <= 0 && \result == expected) && unknown-#memory_int-unknown[s][s] == len + i) && unknown-#memory_int-unknown[head][head] == expected) && 2 + i <= len) && index <= 0) && 0 <= i) && data == len + i) && expected <= 2) && len == 2) && s == head) && head == s) && 2 <= expected) [2022-07-12 03:38:23,187 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:38:23,187 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:38:23,188 INFO L158 Benchmark]: Toolchain (without parser) took 73952.58ms. Allocated memory was 102.8MB in the beginning and 172.0MB in the end (delta: 69.2MB). Free memory was 75.2MB in the beginning and 105.7MB in the end (delta: -30.4MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2022-07-12 03:38:23,188 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 102.8MB. Free memory was 68.3MB in the beginning and 68.2MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:38:23,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.96ms. Allocated memory is still 102.8MB. Free memory was 75.0MB in the beginning and 68.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 03:38:23,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.44ms. Allocated memory is still 102.8MB. Free memory was 68.8MB in the beginning and 66.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:38:23,189 INFO L158 Benchmark]: Boogie Preprocessor took 39.02ms. Allocated memory is still 102.8MB. Free memory was 66.7MB in the beginning and 65.2MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:38:23,189 INFO L158 Benchmark]: RCFGBuilder took 346.62ms. Allocated memory is still 102.8MB. Free memory was 65.2MB in the beginning and 52.4MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:38:23,189 INFO L158 Benchmark]: TraceAbstraction took 73117.97ms. Allocated memory was 102.8MB in the beginning and 172.0MB in the end (delta: 69.2MB). Free memory was 51.9MB in the beginning and 109.9MB in the end (delta: -57.9MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2022-07-12 03:38:23,190 INFO L158 Benchmark]: Witness Printer took 45.58ms. Allocated memory is still 172.0MB. Free memory was 109.9MB in the beginning and 105.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:38:23,192 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.10ms. Allocated memory is still 102.8MB. Free memory was 68.3MB in the beginning and 68.2MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.96ms. Allocated memory is still 102.8MB. Free memory was 75.0MB in the beginning and 68.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.44ms. Allocated memory is still 102.8MB. Free memory was 68.8MB in the beginning and 66.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.02ms. Allocated memory is still 102.8MB. Free memory was 66.7MB in the beginning and 65.2MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 346.62ms. Allocated memory is still 102.8MB. Free memory was 65.2MB in the beginning and 52.4MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 73117.97ms. Allocated memory was 102.8MB in the beginning and 172.0MB in the end (delta: 69.2MB). Free memory was 51.9MB in the beginning and 109.9MB in the end (delta: -57.9MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. * Witness Printer took 45.58ms. Allocated memory is still 172.0MB. Free memory was 109.9MB in the beginning and 105.7MB 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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,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_393,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,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_393,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] * 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: 630]: 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 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73.0s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 44.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 505 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 505 mSDsluCounter, 1077 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 245 IncrementalHoareTripleChecker+Unchecked, 789 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 961 IncrementalHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 288 mSDtfsCounter, 961 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 512 GetRequests, 349 SyntacticMatches, 14 SemanticMatches, 149 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 22.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=9, InterpolantAutomatonStates: 93, 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, 81 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 31 NumberOfFragments, 1061 HoareAnnotationTreeSize, 12 FomulaSimplifications, 6230 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 2139 FormulaSimplificationTreeSizeReductionInter, 44.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 613 NumberOfCodeBlocks, 611 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 753 ConstructedInterpolants, 13 QuantifiedInterpolants, 6435 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1813 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 254/346 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: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant [2022-07-12 03:38:23,214 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,215 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,215 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((!(s == #memory_$Pointer$[s][4]) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && unknown-#memory_int-unknown[s][s] + 2 <= len * 2) && index <= 0) && len * 2 == 2 + data) && s == head) && head == s) && i <= 1) && len == i + 1) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) || ((((((((index <= 0 && unknown-#memory_int-unknown[s][s] + 2 <= len * 2) && 2 + i <= len) && index <= 0) && len * 2 == 2 + data) && len == 2) && s == head) && head == s) && len <= unknown-#memory_int-unknown[s][s]) - InvariantResult [Line: 583]: Loop Invariant [2022-07-12 03:38:23,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,217 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (\result == 0 && !(#memory_$Pointer$[\result][4] == \result)) && len == 2 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 599]: Loop Invariant [2022-07-12 03:38:23,217 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,217 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,217 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,220 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((index <= 0 && !(s == #memory_$Pointer$[s][4])) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && 2 * expected == 2 * ((-1 + expected) / 2) + unknown-#memory_int-unknown[head][head] + 1) && unknown-#memory_int-unknown[s][s] + 2 <= len * 2) && 2 * expected == 2 * ((-1 + expected) / 2) + \result + 1) && index <= 0) && len * 2 == 2 + data) && s == head) && head == s) && i <= 1) && (expected + 1) % 2 == 0) && len == i + 1) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) || ((((((((((((index <= 0 && \result == expected) && unknown-#memory_int-unknown[s][s] == len + i) && unknown-#memory_int-unknown[head][head] == expected) && 2 + i <= len) && index <= 0) && 0 <= i) && data == len + i) && expected <= 2) && len == 2) && s == head) && head == s) && 2 <= expected) - InvariantResult [Line: 585]: Loop Invariant [2022-07-12 03:38:23,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((2 == len && len == 2) || (((((\valid[temp] == 1 && \valid[head] == 1) && temp == 0) && 1 <= len) && len == 2) && \valid[\result] == 1)) || (((\valid[head] == 1 && !(head == #memory_$Pointer$[head][head + 4])) && head == 0) && len == 2) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant [2022-07-12 03:38:23,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] [2022-07-12 03:38:23,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] [2022-07-12 03:38:23,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,224 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,224 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,224 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] [2022-07-12 03:38:23,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] [2022-07-12 03:38:23,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((!(s == #memory_$Pointer$[s][4]) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && len == 2 + i) && index <= 0) && len == 2) && s == 0) || ((((((((((!(s == #memory_$Pointer$[s][4]) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && unknown-#memory_int-unknown[s][s] + 2 <= len * 2) && 2 + i <= len) && index <= 0) && len * 2 == 2 + data) && len == 2) && s == head) && head == s) && s == 0) && len <= unknown-#memory_int-unknown[s][s])) || ((((((forall v_ULTIMATE.start_sll_update_at_~head#1.offset_9 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_9 || (forall v_ArrVal_390 : [int]int, v_ArrVal_393 : int :: !(s == #memory_$Pointer$[#memory_$Pointer$[s][s + 4] := v_ArrVal_390][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_9 := v_ArrVal_393][s + 4]))) && \result == 0) && !(#memory_$Pointer$[\result][4] == \result)) && len == 2) && len == i + 1) && s == 0) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: (((((((!(temp == head) && \valid[temp] == 1) && temp == 0) && 1 <= len) && \result == 0) && !(\result == head)) && len == 2) && \valid[\result] == 1) || ((((2 == len && \valid[temp] == 1) && temp == 0) && len == 2) && \valid[\result] == 1) - InvariantResult [Line: 600]: Loop Invariant [2022-07-12 03:38:23,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((index <= 0 && unknown-#memory_int-unknown[s][s] == len + i) && unknown-#memory_int-unknown[head][head] == expected) && 2 + i <= len) && index <= 0) && 0 <= i) && data == len + i) && expected <= 2) && len == 2) && s == head) && head == s) && 2 <= expected) || ((((((((((((((((!(s == #memory_$Pointer$[s][4]) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && 1 <= index) && !(head == #memory_$Pointer$[head][4])) && 2 * ((-1 + expected) / 2) + unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] + 1 == 2 * expected) && unknown-#memory_int-unknown[s][s] + 2 <= len * 2) && index <= 1) && index <= 0) && len * 2 == 2 + data) && s == head) && head == s) && i <= 1) && head == 0) && (expected + 1) % 2 == 0) && len == i + 1) && s == 0) && len <= unknown-#memory_int-unknown[s][s])) || (((((((((((((index <= 0 && !(s == #memory_$Pointer$[s][4])) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && 2 * expected == 2 * ((-1 + expected) / 2) + unknown-#memory_int-unknown[head][head] + 1) && unknown-#memory_int-unknown[s][s] + 2 <= len * 2) && index <= 0) && len * 2 == 2 + data) && s == head) && head == s) && i <= 1) && (expected + 1) % 2 == 0) && len == i + 1) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) - InvariantResult [Line: 607]: Loop Invariant [2022-07-12 03:38:23,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,233 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,233 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] [2022-07-12 03:38:23,233 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] [2022-07-12 03:38:23,233 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,234 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,234 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] [2022-07-12 03:38:23,234 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] [2022-07-12 03:38:23,234 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,235 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,237 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,237 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] [2022-07-12 03:38:23,237 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] [2022-07-12 03:38:23,237 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:38:23,237 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] [2022-07-12 03:38:23,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:38:23,238 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_390,QUANTIFIED] [2022-07-12 03:38:23,238 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_393,QUANTIFIED] [2022-07-12 03:38:23,238 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_9,QUANTIFIED] Derived loop invariant: ((((((((((!(s == #memory_$Pointer$[s][4]) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && 2 + i <= len) && 0 <= i) && data == len + i) && len == 2) && s == head) && index == i) && head == s) && s == 0) || ((((((((!(#memory_$Pointer$[head][4 + head] == s) && data == len + i) && index <= 1) && 1 <= index) && len == 2) && s == head) && head == s) && len == i + 1) && s == 0)) || ((((((((forall v_ULTIMATE.start_sll_update_at_~head#1.offset_9 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_9 || (forall v_ArrVal_390 : [int]int, v_ArrVal_393 : int :: head == #memory_$Pointer$[head := v_ArrVal_390][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_9 := v_ArrVal_393][s + 4])) && index <= 0) && len == 2) && len * 2 == data + 1) && head == #memory_$Pointer$[s][s + 4]) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_9 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_9 || (forall v_ArrVal_390 : [int]int, v_ArrVal_393 : int :: !(#memory_$Pointer$[head := v_ArrVal_390][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_9 := v_ArrVal_393][s + 4] == s)))) && len == i + 1) && s == 0) RESULT: Ultimate proved your program to be correct! [2022-07-12 03:38:23,249 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