./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_append_equal.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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 01:07:17,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 01:07:17,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 01:07:17,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 01:07:17,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 01:07:17,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 01:07:17,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 01:07:17,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 01:07:17,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 01:07:17,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 01:07:17,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 01:07:17,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 01:07:17,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 01:07:17,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 01:07:17,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 01:07:17,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 01:07:17,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 01:07:17,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 01:07:17,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 01:07:17,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 01:07:17,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 01:07:17,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 01:07:17,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 01:07:17,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 01:07:17,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 01:07:17,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 01:07:17,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 01:07:17,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 01:07:17,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 01:07:17,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 01:07:17,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 01:07:17,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 01:07:17,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 01:07:17,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 01:07:17,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 01:07:17,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 01:07:17,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 01:07:17,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 01:07:17,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 01:07:17,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 01:07:17,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 01:07:17,946 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 01:07:17,978 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 01:07:17,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 01:07:17,982 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 01:07:17,982 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 01:07:17,983 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 01:07:17,983 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 01:07:17,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 01:07:17,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 01:07:17,985 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 01:07:17,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 01:07:17,986 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 01:07:17,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 01:07:17,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 01:07:17,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 01:07:17,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 01:07:17,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 01:07:17,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 01:07:17,987 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 01:07:17,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 01:07:17,987 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 01:07:17,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 01:07:17,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 01:07:17,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 01:07:17,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 01:07:17,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:07:17,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 01:07:17,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 01:07:17,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 01:07:17,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 01:07:17,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 01:07:17,990 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 01:07:17,990 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 01:07:17,990 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 01:07:17,990 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 01:07:17,990 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 01:07:17,991 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2023-02-16 01:07:18,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 01:07:18,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 01:07:18,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 01:07:18,269 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 01:07:18,269 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 01:07:18,271 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-02-16 01:07:19,428 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 01:07:19,666 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 01:07:19,666 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-02-16 01:07:19,675 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1580824/6de0eed9f91a494fbc2c661d718d6fbe/FLAG346d714bd [2023-02-16 01:07:19,686 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1580824/6de0eed9f91a494fbc2c661d718d6fbe [2023-02-16 01:07:19,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 01:07:19,689 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 01:07:19,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 01:07:19,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 01:07:19,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 01:07:19,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:07:19" (1/1) ... [2023-02-16 01:07:19,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ecd7b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:19, skipping insertion in model container [2023-02-16 01:07:19,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:07:19" (1/1) ... [2023-02-16 01:07:19,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 01:07:19,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 01:07:19,946 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-02-16 01:07:19,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:07:19,970 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 01:07:20,005 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-02-16 01:07:20,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:07:20,045 INFO L208 MainTranslator]: Completed translation [2023-02-16 01:07:20,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:20 WrapperNode [2023-02-16 01:07:20,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 01:07:20,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 01:07:20,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 01:07:20,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 01:07:20,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:20" (1/1) ... [2023-02-16 01:07:20,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:20" (1/1) ... [2023-02-16 01:07:20,083 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2023-02-16 01:07:20,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 01:07:20,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 01:07:20,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 01:07:20,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 01:07:20,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:20" (1/1) ... [2023-02-16 01:07:20,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:20" (1/1) ... [2023-02-16 01:07:20,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:20" (1/1) ... [2023-02-16 01:07:20,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:20" (1/1) ... [2023-02-16 01:07:20,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:20" (1/1) ... [2023-02-16 01:07:20,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:20" (1/1) ... [2023-02-16 01:07:20,110 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:20" (1/1) ... [2023-02-16 01:07:20,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:20" (1/1) ... [2023-02-16 01:07:20,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 01:07:20,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 01:07:20,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 01:07:20,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 01:07:20,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:20" (1/1) ... [2023-02-16 01:07:20,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:07:20,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:07:20,146 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) [2023-02-16 01:07:20,147 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 [2023-02-16 01:07:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 01:07:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 01:07:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-16 01:07:20,188 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-16 01:07:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 01:07:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 01:07:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 01:07:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 01:07:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 01:07:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 01:07:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 01:07:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 01:07:20,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 01:07:20,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 01:07:20,332 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 01:07:20,333 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 01:07:20,642 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 01:07:20,647 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 01:07:20,648 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-16 01:07:20,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:07:20 BoogieIcfgContainer [2023-02-16 01:07:20,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 01:07:20,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 01:07:20,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 01:07:20,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 01:07:20,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 01:07:19" (1/3) ... [2023-02-16 01:07:20,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708fadc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:07:20, skipping insertion in model container [2023-02-16 01:07:20,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:20" (2/3) ... [2023-02-16 01:07:20,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708fadc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:07:20, skipping insertion in model container [2023-02-16 01:07:20,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:07:20" (3/3) ... [2023-02-16 01:07:20,657 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-02-16 01:07:20,675 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 01:07:20,676 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 01:07:20,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 01:07:20,740 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@712a4110, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 01:07:20,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 01:07:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 01:07:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 01:07:20,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:20,754 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:07:20,755 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2023-02-16 01:07:20,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:20,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806105497] [2023-02-16 01:07:20,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:20,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:20,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:21,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:07:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:07:21,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:21,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806105497] [2023-02-16 01:07:21,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806105497] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:07:21,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:07:21,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 01:07:21,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591371055] [2023-02-16 01:07:21,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:07:21,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 01:07:21,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:21,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 01:07:21,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 01:07:21,086 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 01:07:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:07:21,182 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2023-02-16 01:07:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 01:07:21,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-02-16 01:07:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:07:21,191 INFO L225 Difference]: With dead ends: 65 [2023-02-16 01:07:21,192 INFO L226 Difference]: Without dead ends: 28 [2023-02-16 01:07:21,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 01:07:21,200 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:07:21,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:07:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-16 01:07:21,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-16 01:07:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 01:07:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-02-16 01:07:21,236 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2023-02-16 01:07:21,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:07:21,238 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-02-16 01:07:21,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 01:07:21,238 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-02-16 01:07:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 01:07:21,242 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:21,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:07:21,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 01:07:21,243 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:21,244 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2023-02-16 01:07:21,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:21,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636436268] [2023-02-16 01:07:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:21,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:21,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:07:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:07:21,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:21,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636436268] [2023-02-16 01:07:21,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636436268] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:07:21,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:07:21,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 01:07:21,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110443531] [2023-02-16 01:07:21,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:07:21,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:07:21,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:21,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:07:21,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:07:21,566 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 01:07:21,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:07:21,626 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-02-16 01:07:21,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 01:07:21,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-02-16 01:07:21,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:07:21,631 INFO L225 Difference]: With dead ends: 52 [2023-02-16 01:07:21,632 INFO L226 Difference]: Without dead ends: 31 [2023-02-16 01:07:21,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:07:21,638 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:07:21,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:07:21,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-16 01:07:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-16 01:07:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 01:07:21,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-02-16 01:07:21,652 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2023-02-16 01:07:21,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:07:21,652 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-02-16 01:07:21,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 01:07:21,653 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-02-16 01:07:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 01:07:21,655 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:21,655 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:07:21,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 01:07:21,656 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:21,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:21,656 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2023-02-16 01:07:21,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:21,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359233987] [2023-02-16 01:07:21,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:21,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:22,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:22,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:07:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:22,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:07:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:07:22,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:22,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359233987] [2023-02-16 01:07:22,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359233987] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:22,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424159205] [2023-02-16 01:07:22,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:22,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:07:22,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:07:22,286 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) [2023-02-16 01:07:22,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 01:07:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:22,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-16 01:07:22,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:07:22,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-16 01:07:22,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:22,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-16 01:07:22,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-16 01:07:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 01:07:22,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:07:22,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424159205] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:22,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:07:22,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-02-16 01:07:22,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374225940] [2023-02-16 01:07:22,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:07:22,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-16 01:07:22,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:22,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-16 01:07:22,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=518, Unknown=7, NotChecked=0, Total=600 [2023-02-16 01:07:22,903 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 01:07:23,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:07:23,280 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2023-02-16 01:07:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 01:07:23,281 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2023-02-16 01:07:23,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:07:23,281 INFO L225 Difference]: With dead ends: 39 [2023-02-16 01:07:23,281 INFO L226 Difference]: Without dead ends: 31 [2023-02-16 01:07:23,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=835, Unknown=7, NotChecked=0, Total=992 [2023-02-16 01:07:23,283 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 100 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 01:07:23,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 178 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 01:07:23,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-16 01:07:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-16 01:07:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 01:07:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-02-16 01:07:23,289 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2023-02-16 01:07:23,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:07:23,289 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-02-16 01:07:23,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 01:07:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-02-16 01:07:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 01:07:23,290 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:23,290 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:07:23,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 01:07:23,497 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 [2023-02-16 01:07:23,498 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:23,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:23,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2023-02-16 01:07:23,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:23,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445525544] [2023-02-16 01:07:23,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:23,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:24,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:24,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:07:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:07:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:07:24,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:24,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445525544] [2023-02-16 01:07:24,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445525544] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:24,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081127493] [2023-02-16 01:07:24,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:24,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:07:24,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:07:24,504 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) [2023-02-16 01:07:24,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 01:07:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:24,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 118 conjunts are in the unsatisfiable core [2023-02-16 01:07:24,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:07:24,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:07:24,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:25,048 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:07:25,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 01:07:25,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 01:07:25,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 01:07:25,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2023-02-16 01:07:25,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 01:07:25,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:25,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 01:07:25,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:25,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 01:07:25,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:25,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-02-16 01:07:25,624 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-16 01:07:25,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-16 01:07:25,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 01:07:25,922 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 01:07:25,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 71 [2023-02-16 01:07:25,945 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 01:07:25,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 114 [2023-02-16 01:07:25,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2023-02-16 01:07:25,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:25,974 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-16 01:07:25,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 87 [2023-02-16 01:07:25,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-16 01:07:26,041 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:07:26,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 28 [2023-02-16 01:07:26,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:07:26,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:07:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:07:26,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:07:26,244 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_505 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_505)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_508) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_512) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-16 01:07:28,246 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_523 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_505 Int) (v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_523))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_521)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_522))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_505))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_508) (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store .cse4 .cse1 v_ArrVal_512) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_509) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11|))))) is different from false [2023-02-16 01:07:28,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081127493] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:28,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:07:28,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 38 [2023-02-16 01:07:28,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986847148] [2023-02-16 01:07:28,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:07:28,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-16 01:07:28,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:28,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-16 01:07:28,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1642, Unknown=44, NotChecked=166, Total=1980 [2023-02-16 01:07:28,253 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 38 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 30 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:07:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:07:31,470 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2023-02-16 01:07:31,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-16 01:07:31,471 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 30 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2023-02-16 01:07:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:07:31,472 INFO L225 Difference]: With dead ends: 66 [2023-02-16 01:07:31,472 INFO L226 Difference]: Without dead ends: 57 [2023-02-16 01:07:31,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=436, Invalid=3682, Unknown=50, NotChecked=254, Total=4422 [2023-02-16 01:07:31,475 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 194 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 01:07:31,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 368 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-16 01:07:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-16 01:07:31,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2023-02-16 01:07:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 01:07:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-02-16 01:07:31,494 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 35 [2023-02-16 01:07:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:07:31,494 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-02-16 01:07:31,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 30 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:07:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-02-16 01:07:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 01:07:31,497 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:31,497 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:07:31,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 01:07:31,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-16 01:07:31,698 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:31,698 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2023-02-16 01:07:31,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:31,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916036069] [2023-02-16 01:07:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:31,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:33,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:33,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:07:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:33,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:07:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:07:33,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:33,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916036069] [2023-02-16 01:07:33,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916036069] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:33,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795693754] [2023-02-16 01:07:33,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:33,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:07:33,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:07:33,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) [2023-02-16 01:07:33,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 01:07:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:34,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 122 conjunts are in the unsatisfiable core [2023-02-16 01:07:34,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:07:34,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:07:34,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 01:07:34,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:34,368 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:07:34,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 01:07:34,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 01:07:34,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:34,599 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:07:34,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2023-02-16 01:07:34,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 01:07:34,790 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:07:34,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 34 [2023-02-16 01:07:34,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 01:07:34,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:34,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 01:07:35,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:35,037 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:07:35,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2023-02-16 01:07:35,055 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 01:07:35,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-02-16 01:07:35,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 01:07:35,086 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 01:07:35,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-16 01:07:35,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:35,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 01:07:35,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:35,603 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-16 01:07:35,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 101 [2023-02-16 01:07:35,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:35,635 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-02-16 01:07:35,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 53 [2023-02-16 01:07:35,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:35,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:35,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2023-02-16 01:07:35,723 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:07:35,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 27 [2023-02-16 01:07:35,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:07:35,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:07:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:07:35,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:07:35,935 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_714) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_717) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_718) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_715) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_716) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_719) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 01:07:35,957 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_714) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_717) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_718) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_715) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_716) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_719) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 01:07:35,979 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_714) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_717) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_718) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_715) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_716) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_719) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 01:07:35,991 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_714) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_717) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_718) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_715) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_716) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_719) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 01:07:36,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795693754] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:36,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:07:36,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 42 [2023-02-16 01:07:36,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423913256] [2023-02-16 01:07:36,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:07:36,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-16 01:07:36,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:36,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-16 01:07:36,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1846, Unknown=5, NotChecked=356, Total=2352 [2023-02-16 01:07:36,248 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 42 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 33 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:07:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:07:38,618 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2023-02-16 01:07:38,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 01:07:38,619 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 33 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2023-02-16 01:07:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:07:38,621 INFO L225 Difference]: With dead ends: 65 [2023-02-16 01:07:38,621 INFO L226 Difference]: Without dead ends: 63 [2023-02-16 01:07:38,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=368, Invalid=3303, Unknown=5, NotChecked=484, Total=4160 [2023-02-16 01:07:38,623 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 253 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 01:07:38,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 254 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 01:07:38,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-16 01:07:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2023-02-16 01:07:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 01:07:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-02-16 01:07:38,637 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 37 [2023-02-16 01:07:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:07:38,637 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-02-16 01:07:38,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 33 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:07:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-02-16 01:07:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 01:07:38,639 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:38,639 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:07:38,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-16 01:07:38,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:07:38,852 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:38,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:38,852 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2023-02-16 01:07:38,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:38,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328484841] [2023-02-16 01:07:38,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:38,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:39,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:39,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:07:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:39,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:07:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:07:39,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:39,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328484841] [2023-02-16 01:07:39,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328484841] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:39,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503847952] [2023-02-16 01:07:39,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:07:39,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:07:39,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:07:39,979 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) [2023-02-16 01:07:39,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 01:07:40,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:07:40,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:07:40,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 177 conjunts are in the unsatisfiable core [2023-02-16 01:07:40,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:07:40,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:07:40,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:40,600 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:07:40,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 01:07:40,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:40,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 01:07:40,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:40,772 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 01:07:40,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 44 [2023-02-16 01:07:40,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 01:07:40,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-02-16 01:07:40,962 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-02-16 01:07:40,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 49 [2023-02-16 01:07:40,976 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:07:40,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-02-16 01:07:41,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:41,175 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-16 01:07:41,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 87 [2023-02-16 01:07:41,189 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 01:07:41,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-16 01:07:41,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 01:07:41,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:41,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:41,211 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-16 01:07:41,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 48 [2023-02-16 01:07:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:07:41,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:07:41,809 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_926) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_933) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_928) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_929) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-16 01:07:42,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503847952] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:42,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:07:42,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2023-02-16 01:07:42,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154414233] [2023-02-16 01:07:42,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:07:42,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-16 01:07:42,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:42,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-16 01:07:42,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2361, Unknown=4, NotChecked=98, Total=2652 [2023-02-16 01:07:42,862 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 40 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:07:44,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:07:44,275 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2023-02-16 01:07:44,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 01:07:44,276 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2023-02-16 01:07:44,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:07:44,277 INFO L225 Difference]: With dead ends: 71 [2023-02-16 01:07:44,277 INFO L226 Difference]: Without dead ends: 60 [2023-02-16 01:07:44,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=368, Invalid=3538, Unknown=4, NotChecked=122, Total=4032 [2023-02-16 01:07:44,279 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 84 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 01:07:44,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 202 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 01:07:44,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-16 01:07:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2023-02-16 01:07:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 01:07:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2023-02-16 01:07:44,292 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 39 [2023-02-16 01:07:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:07:44,292 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2023-02-16 01:07:44,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:07:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2023-02-16 01:07:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 01:07:44,293 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:44,293 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:07:44,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 01:07:44,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:07:44,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:44,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:44,508 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2023-02-16 01:07:44,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:44,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25733626] [2023-02-16 01:07:44,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:44,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:45,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:45,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:07:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:45,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:07:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:07:45,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:45,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25733626] [2023-02-16 01:07:45,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25733626] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:45,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010288035] [2023-02-16 01:07:45,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:45,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:07:45,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:07:45,961 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) [2023-02-16 01:07:45,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 01:07:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:46,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 107 conjunts are in the unsatisfiable core [2023-02-16 01:07:46,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:07:46,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:07:46,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 01:07:46,292 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:07:46,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 01:07:46,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:46,439 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-16 01:07:46,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-16 01:07:46,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:46,605 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:07:46,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-16 01:07:46,748 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-16 01:07:46,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 26 [2023-02-16 01:07:46,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-16 01:07:46,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:46,899 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:07:46,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 67 [2023-02-16 01:07:46,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:46,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2023-02-16 01:07:46,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:46,919 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-16 01:07:46,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2023-02-16 01:07:47,239 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2023-02-16 01:07:47,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 67 [2023-02-16 01:07:47,263 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-16 01:07:47,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 112 [2023-02-16 01:07:47,291 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-02-16 01:07:47,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 147 [2023-02-16 01:07:47,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 93 [2023-02-16 01:07:47,528 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-16 01:07:47,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 38 [2023-02-16 01:07:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:07:47,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:07:47,707 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1134 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1129))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1134) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1128) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-16 01:07:47,717 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1134 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1129))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1134) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1128) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-16 01:07:47,726 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1134 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1129))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1134) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1128) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-16 01:07:47,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010288035] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:47,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:07:47,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 43 [2023-02-16 01:07:47,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045843222] [2023-02-16 01:07:47,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:07:47,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-16 01:07:47,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:47,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-16 01:07:47,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1817, Unknown=35, NotChecked=264, Total=2256 [2023-02-16 01:07:47,871 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 43 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:07:50,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 01:07:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:07:51,546 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2023-02-16 01:07:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 01:07:51,546 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2023-02-16 01:07:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:07:51,547 INFO L225 Difference]: With dead ends: 69 [2023-02-16 01:07:51,547 INFO L226 Difference]: Without dead ends: 66 [2023-02-16 01:07:51,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=324, Invalid=2845, Unknown=35, NotChecked=336, Total=3540 [2023-02-16 01:07:51,549 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 251 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-16 01:07:51,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 261 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 802 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2023-02-16 01:07:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-16 01:07:51,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2023-02-16 01:07:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 01:07:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2023-02-16 01:07:51,563 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 40 [2023-02-16 01:07:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:07:51,564 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2023-02-16 01:07:51,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:07:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2023-02-16 01:07:51,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 01:07:51,566 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:51,566 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:07:51,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 01:07:51,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:07:51,769 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:51,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:51,769 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2023-02-16 01:07:51,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:51,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271583450] [2023-02-16 01:07:51,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:51,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:53,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:53,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:07:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:53,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:07:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:07:53,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:53,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271583450] [2023-02-16 01:07:53,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271583450] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:53,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721363218] [2023-02-16 01:07:53,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:53,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:07:53,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:07:53,997 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) [2023-02-16 01:07:54,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 01:07:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:54,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 186 conjunts are in the unsatisfiable core [2023-02-16 01:07:54,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:07:54,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:07:54,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 01:07:54,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:54,510 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:07:54,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 01:07:54,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 01:07:54,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:54,820 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-16 01:07:54,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-16 01:07:54,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 01:07:54,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 01:07:54,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:54,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:55,034 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:07:55,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2023-02-16 01:07:55,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-02-16 01:07:55,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 01:07:55,238 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:07:55,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2023-02-16 01:07:55,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 01:07:55,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-16 01:07:55,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:07:55,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:55,483 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:07:55,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 67 [2023-02-16 01:07:55,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:55,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:55,501 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 01:07:55,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2023-02-16 01:07:55,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:55,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:55,528 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 01:07:55,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-16 01:07:55,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 01:07:56,251 INFO L321 Elim1Store]: treesize reduction 147, result has 13.0 percent of original size [2023-02-16 01:07:56,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 260 treesize of output 129 [2023-02-16 01:07:56,280 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-16 01:07:56,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 370 treesize of output 247 [2023-02-16 01:07:56,310 INFO L321 Elim1Store]: treesize reduction 140, result has 13.6 percent of original size [2023-02-16 01:07:56,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 343 treesize of output 216 [2023-02-16 01:07:56,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2023-02-16 01:07:56,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:56,351 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2023-02-16 01:07:56,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 154 [2023-02-16 01:07:56,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2023-02-16 01:07:56,611 INFO L321 Elim1Store]: treesize reduction 44, result has 26.7 percent of original size [2023-02-16 01:07:56,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 81 [2023-02-16 01:07:56,725 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 01:07:56,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2023-02-16 01:07:56,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:07:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:07:56,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:07:57,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1351 Int) (v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1350)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1341))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_1351)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1345) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 01:07:57,735 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| Int) (v_ArrVal_1351 Int) (v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1361 (Array Int Int)) (v_ArrVal_1350 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1359)) (.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1360))) (let ((.cse2 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse11 (select (select .cse10 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select .cse9 .cse2) .cse11))) (let ((.cse0 (select .cse9 .cse4)) (.cse1 (select (select .cse10 .cse2) .cse11))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| |c_#StackHeapBarrier|)) (not (= (select .cse0 .cse1) .cse2)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23|))) (= (let ((.cse8 (store (store .cse10 .cse4 (store (select .cse10 .cse4) .cse1 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1350)) (.cse5 (store (store .cse9 .cse4 (store .cse0 .cse1 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1341))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse3 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1361))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse1 v_ArrVal_1351))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1345) (select (select .cse5 .cse6) .cse7)) (+ (select (select .cse8 .cse6) .cse7) 4)))) |c_ULTIMATE.start_main_~data~0#1|))))))) is different from false [2023-02-16 01:07:57,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721363218] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:57,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:07:57,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29] total 51 [2023-02-16 01:07:57,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126295314] [2023-02-16 01:07:57,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:07:57,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-16 01:07:57,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:57,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-16 01:07:57,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=3217, Unknown=4, NotChecked=230, Total=3660 [2023-02-16 01:07:57,740 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 51 states, 47 states have (on average 1.446808510638298) internal successors, (68), 41 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:08:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:00,311 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2023-02-16 01:08:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-16 01:08:00,312 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.446808510638298) internal successors, (68), 41 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2023-02-16 01:08:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:00,313 INFO L225 Difference]: With dead ends: 66 [2023-02-16 01:08:00,313 INFO L226 Difference]: Without dead ends: 64 [2023-02-16 01:08:00,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=499, Invalid=5357, Unknown=4, NotChecked=302, Total=6162 [2023-02-16 01:08:00,315 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 196 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:00,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 197 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 01:08:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-16 01:08:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2023-02-16 01:08:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 01:08:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2023-02-16 01:08:00,331 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 41 [2023-02-16 01:08:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:00,332 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2023-02-16 01:08:00,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.446808510638298) internal successors, (68), 41 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:08:00,332 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2023-02-16 01:08:00,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 01:08:00,333 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:00,333 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:08:00,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 01:08:00,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:00,537 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:00,537 INFO L85 PathProgramCache]: Analyzing trace with hash -364798159, now seen corresponding path program 1 times [2023-02-16 01:08:00,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:00,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544630030] [2023-02-16 01:08:00,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:00,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:02,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:02,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:02,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:08:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:08:02,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:02,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544630030] [2023-02-16 01:08:02,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544630030] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:02,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679616279] [2023-02-16 01:08:02,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:02,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:02,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:02,489 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) [2023-02-16 01:08:02,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 01:08:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:02,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 112 conjunts are in the unsatisfiable core [2023-02-16 01:08:02,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:02,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:08:02,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 01:08:02,880 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:08:02,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 01:08:02,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:03,026 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-16 01:08:03,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-16 01:08:03,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:03,214 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:08:03,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-16 01:08:03,369 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-16 01:08:03,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 26 [2023-02-16 01:08:03,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-16 01:08:03,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:03,539 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:08:03,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 67 [2023-02-16 01:08:03,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:03,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2023-02-16 01:08:03,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:03,558 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-16 01:08:03,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2023-02-16 01:08:03,964 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2023-02-16 01:08:03,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 78 [2023-02-16 01:08:03,990 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-16 01:08:03,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 241 treesize of output 162 [2023-02-16 01:08:04,018 INFO L321 Elim1Store]: treesize reduction 102, result has 16.4 percent of original size [2023-02-16 01:08:04,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 199 treesize of output 172 [2023-02-16 01:08:04,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 107 [2023-02-16 01:08:04,382 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-16 01:08:04,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 38 [2023-02-16 01:08:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:08:04,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:04,618 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (not (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1546))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1547) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1552))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2)))))))))) is different from false [2023-02-16 01:08:04,630 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1546))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1547) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1552))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) is different from false [2023-02-16 01:08:04,640 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1546))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1547) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1552))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) is different from false [2023-02-16 01:08:04,699 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1547 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| Int) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (or (not (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| v_ArrVal_1557)) (.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| v_ArrVal_1558))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse8 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse5 (select (select .cse6 .cse7) .cse8))) (let ((.cse1 (store (store .cse6 .cse5 (store (select .cse6 .cse5) (select (select .cse4 .cse7) .cse8) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| v_ArrVal_1546))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store .cse4 .cse5 v_ArrVal_1547) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| v_ArrVal_1552))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26|))))) is different from false [2023-02-16 01:08:04,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679616279] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:04,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:08:04,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 49 [2023-02-16 01:08:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125715446] [2023-02-16 01:08:04,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:08:04,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-16 01:08:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:04,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-16 01:08:04,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2290, Unknown=40, NotChecked=396, Total=2862 [2023-02-16 01:08:04,704 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 49 states, 45 states have (on average 1.511111111111111) internal successors, (68), 40 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:08:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:08,320 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2023-02-16 01:08:08,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-16 01:08:08,320 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.511111111111111) internal successors, (68), 40 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2023-02-16 01:08:08,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:08,321 INFO L225 Difference]: With dead ends: 73 [2023-02-16 01:08:08,321 INFO L226 Difference]: Without dead ends: 70 [2023-02-16 01:08:08,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=402, Invalid=4266, Unknown=40, NotChecked=548, Total=5256 [2023-02-16 01:08:08,323 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 282 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:08,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 415 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-16 01:08:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-16 01:08:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 57. [2023-02-16 01:08:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 01:08:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2023-02-16 01:08:08,341 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 44 [2023-02-16 01:08:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:08,341 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2023-02-16 01:08:08,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.511111111111111) internal successors, (68), 40 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:08:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2023-02-16 01:08:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 01:08:08,343 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:08,343 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:08:08,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 01:08:08,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:08,549 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:08,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:08,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2042609176, now seen corresponding path program 3 times [2023-02-16 01:08:08,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:08,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016233939] [2023-02-16 01:08:08,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:08,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:08,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:08,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-16 01:08:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:08,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-16 01:08:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-16 01:08:08,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:08,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016233939] [2023-02-16 01:08:08,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016233939] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:08,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690866601] [2023-02-16 01:08:08,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 01:08:08,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:08,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:08,670 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:08:08,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 01:08:08,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 01:08:08,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:08:08,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 01:08:08,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 01:08:08,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 01:08:08,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690866601] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:08:08,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 01:08:08,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-16 01:08:08,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521881849] [2023-02-16 01:08:08,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:08:08,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:08:08,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:08,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:08:08,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 01:08:08,978 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 01:08:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:09,005 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2023-02-16 01:08:09,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 01:08:09,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2023-02-16 01:08:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:09,007 INFO L225 Difference]: With dead ends: 69 [2023-02-16 01:08:09,007 INFO L226 Difference]: Without dead ends: 39 [2023-02-16 01:08:09,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 01:08:09,008 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:09,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 47 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:08:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-16 01:08:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-02-16 01:08:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 01:08:09,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2023-02-16 01:08:09,024 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 45 [2023-02-16 01:08:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:09,025 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2023-02-16 01:08:09,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 01:08:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2023-02-16 01:08:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 01:08:09,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:09,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:08:09,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-16 01:08:09,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-16 01:08:09,235 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:09,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:09,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1576200124, now seen corresponding path program 2 times [2023-02-16 01:08:09,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:09,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277491111] [2023-02-16 01:08:09,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:09,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:10,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:10,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:10,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:08:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:08:11,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:11,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277491111] [2023-02-16 01:08:11,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277491111] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:11,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636475750] [2023-02-16 01:08:11,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:08:11,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:11,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:11,190 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:08:11,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 01:08:11,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:08:11,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:08:11,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 186 conjunts are in the unsatisfiable core [2023-02-16 01:08:11,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:11,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:08:11,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 01:08:11,730 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 0 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2023-02-16 01:08:11,732 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 0 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from true [2023-02-16 01:08:11,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:11,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:11,766 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |c_#valid| .cse0))) |c_#valid|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2023-02-16 01:08:11,768 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |c_#valid| .cse0))) |c_#valid|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from true [2023-02-16 01:08:11,834 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:08:11,843 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 01:08:11,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 37 [2023-02-16 01:08:11,852 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:08:11,859 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 01:08:11,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2023-02-16 01:08:11,874 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (< .cse0 |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_27| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_27| .cse1 (select |c_#valid| .cse1))) |c_#valid|))))) is different from false [2023-02-16 01:08:11,877 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (< .cse0 |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_27| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_27| .cse1 (select |c_#valid| .cse1))) |c_#valid|))))) is different from true [2023-02-16 01:08:11,924 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~data#1| |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse2) 1) (<= .cse1 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) 0) (< .cse0 |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse2) (exists ((|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_27| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_27| .cse3 (select |c_#valid| .cse3))) |c_#valid|))) (<= 0 .cse1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-02-16 01:08:11,926 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~data#1| |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse2) 1) (<= .cse1 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) 0) (< .cse0 |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse2) (exists ((|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_27| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_27| .cse3 (select |c_#valid| .cse3))) |c_#valid|))) (<= 0 .cse1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-02-16 01:08:11,940 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:08:11,948 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-02-16 01:08:11,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 54 [2023-02-16 01:08:11,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:11,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:11,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 16 [2023-02-16 01:08:11,976 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (< v_arrayElimIndex_63 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_33| .cse0))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0)))) is different from false [2023-02-16 01:08:11,978 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (< v_arrayElimIndex_63 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_33| .cse0))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0)))) is different from true [2023-02-16 01:08:12,006 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= 0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= 0 |c_node_create_~temp~0#1.offset|) (= |c_node_create_~data#1| |c_node_create_#in~data#1|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (< v_arrayElimIndex_63 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_33| .cse0))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0)))) is different from false [2023-02-16 01:08:12,008 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= 0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= 0 |c_node_create_~temp~0#1.offset|) (= |c_node_create_~data#1| |c_node_create_#in~data#1|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (< v_arrayElimIndex_63 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_33| .cse0))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0)))) is different from true [2023-02-16 01:08:12,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:12,064 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1969 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_1969))) (= |c_node_create_#res#1.offset| 0) (exists ((v_ArrVal_1972 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1972))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (< v_arrayElimIndex_63 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_33| .cse0))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (= 0 (select |c_old(#valid)| |c_node_create_#res#1.base|))) is different from false [2023-02-16 01:08:12,066 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1969 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_1969))) (= |c_node_create_#res#1.offset| 0) (exists ((v_ArrVal_1972 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1972))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (< v_arrayElimIndex_63 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_33| .cse0))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (= 0 (select |c_old(#valid)| |c_node_create_#res#1.base|))) is different from true [2023-02-16 01:08:12,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:12,136 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-16 01:08:12,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 120 treesize of output 108 [2023-02-16 01:08:12,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:12,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:12,160 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2023-02-16 01:08:12,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 113 [2023-02-16 01:08:12,212 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse3))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_28| .cse2))) |v_old(#valid)_AFTER_CALL_28|))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) .cse3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse3) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse1) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse3) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-02-16 01:08:12,215 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse3))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_28| .cse2))) |v_old(#valid)_AFTER_CALL_28|))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) .cse3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse3) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse1) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse3) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-02-16 01:08:12,302 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse1 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_28| .cse3))) |v_old(#valid)_AFTER_CALL_28|))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse1) (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-02-16 01:08:12,306 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse1 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_28| .cse3))) |v_old(#valid)_AFTER_CALL_28|))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse1) (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-02-16 01:08:12,411 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (<= .cse1 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_28| .cse3))) |v_old(#valid)_AFTER_CALL_28|))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse1) (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-02-16 01:08:12,415 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (<= .cse1 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_28| .cse3))) |v_old(#valid)_AFTER_CALL_28|))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse1) (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-02-16 01:08:12,505 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (<= .cse1 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_28| .cse3))) |v_old(#valid)_AFTER_CALL_28|))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse1) (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-02-16 01:08:12,509 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (<= .cse1 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_28| .cse3))) |v_old(#valid)_AFTER_CALL_28|))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse1) (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-02-16 01:08:12,591 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (<= .cse1 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_28| .cse3))) |v_old(#valid)_AFTER_CALL_28|))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse1) (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-02-16 01:08:12,594 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (<= .cse1 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_28| .cse3))) |v_old(#valid)_AFTER_CALL_28|))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse1) (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-02-16 01:08:12,668 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse1 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse2) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_28| .cse3))) |v_old(#valid)_AFTER_CALL_28|))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse1) (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-02-16 01:08:12,671 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse1 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse2) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_28| .cse3))) |v_old(#valid)_AFTER_CALL_28|))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse1) (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-02-16 01:08:12,749 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse2))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) .cse2) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse2 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_28| .cse3))) |v_old(#valid)_AFTER_CALL_28|))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse2) 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) .cse0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse2) (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-02-16 01:08:12,760 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse2))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) .cse2) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse2 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_28| .cse3))) |v_old(#valid)_AFTER_CALL_28|))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse2) 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) .cse0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse2) (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-02-16 01:08:12,783 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:08:12,832 INFO L321 Elim1Store]: treesize reduction 132, result has 18.5 percent of original size [2023-02-16 01:08:12,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 254 treesize of output 128 [2023-02-16 01:08:12,873 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-16 01:08:12,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 332 treesize of output 201 [2023-02-16 01:08:12,920 INFO L321 Elim1Store]: treesize reduction 116, result has 18.3 percent of original size [2023-02-16 01:08:12,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 306 treesize of output 236 [2023-02-16 01:08:12,951 INFO L321 Elim1Store]: treesize reduction 86, result has 18.9 percent of original size [2023-02-16 01:08:12,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 293 treesize of output 263 [2023-02-16 01:08:12,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:12,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:12,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 47 [2023-02-16 01:08:12,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 50 [2023-02-16 01:08:13,140 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse0))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse2))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse0 0) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse1 (select .cse8 0))) (or (and (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse1) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse4 (select |v_old(#valid)_AFTER_CALL_28| .cse4))) |v_old(#valid)_AFTER_CALL_28|)))) (and (exists ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse5 (select .cse8 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= (select .cse6 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) 0) (= (select (select |c_#memory_int| .cse5) 4) |c_ULTIMATE.start_main_~data~0#1|) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse7 (select |v_old(#valid)_AFTER_CALL_28| .cse7))) |v_old(#valid)_AFTER_CALL_28|)))) (= .cse1 .cse3))))) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse0) 0) (= (select .cse6 0) .cse0) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse9 (select |v_#valid_BEFORE_CALL_33| .cse9))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-16 01:08:13,143 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse0))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse2))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse0 0) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse1 (select .cse8 0))) (or (and (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse1) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse4 (select |v_old(#valid)_AFTER_CALL_28| .cse4))) |v_old(#valid)_AFTER_CALL_28|)))) (and (exists ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse5 (select .cse8 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= (select .cse6 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) 0) (= (select (select |c_#memory_int| .cse5) 4) |c_ULTIMATE.start_main_~data~0#1|) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse7 (select |v_old(#valid)_AFTER_CALL_28| .cse7))) |v_old(#valid)_AFTER_CALL_28|)))) (= .cse1 .cse3))))) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse0) 0) (= (select .cse6 0) .cse0) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse9 (select |v_#valid_BEFORE_CALL_33| .cse9))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from true [2023-02-16 01:08:13,260 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse0))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse2))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse0 0) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse1 (select .cse8 0))) (or (and (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse1) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse4 (select |v_old(#valid)_AFTER_CALL_28| .cse4))) |v_old(#valid)_AFTER_CALL_28|)))) (and (exists ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse5 (select .cse8 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= (select .cse6 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) 0) (= (select (select |c_#memory_int| .cse5) 4) |c_ULTIMATE.start_main_~data~0#1|) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse7 (select |v_old(#valid)_AFTER_CALL_28| .cse7))) |v_old(#valid)_AFTER_CALL_28|)))) (= .cse1 .cse3))))) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse0) 0) (= (select .cse6 0) .cse0) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse9 (select |v_#valid_BEFORE_CALL_33| .cse9))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse0) (<= 0 .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-16 01:08:13,263 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse0))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse2))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse0 0) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse1 (select .cse8 0))) (or (and (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse1) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse4 (select |v_old(#valid)_AFTER_CALL_28| .cse4))) |v_old(#valid)_AFTER_CALL_28|)))) (and (exists ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse5 (select .cse8 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= (select .cse6 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) 0) (= (select (select |c_#memory_int| .cse5) 4) |c_ULTIMATE.start_main_~data~0#1|) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse7 (select |v_old(#valid)_AFTER_CALL_28| .cse7))) |v_old(#valid)_AFTER_CALL_28|)))) (= .cse1 .cse3))))) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse0) 0) (= (select .cse6 0) .cse0) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse9 (select |v_#valid_BEFORE_CALL_33| .cse9))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse0) (<= 0 .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from true [2023-02-16 01:08:13,470 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) .cse1))) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse1)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse0))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (<= .cse1 0) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse8 0))) (or (and (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse2) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse4 (select |v_old(#valid)_AFTER_CALL_28| .cse4))) |v_old(#valid)_AFTER_CALL_28|)))) (and (exists ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse5 (select .cse8 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= (select .cse6 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) 0) (= (select (select |c_#memory_int| .cse5) 4) |c_ULTIMATE.start_main_~data~0#1|) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse7 (select |v_old(#valid)_AFTER_CALL_28| .cse7))) |v_old(#valid)_AFTER_CALL_28|)))) (= .cse2 .cse3))))) (= .cse9 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse9) (= (select .cse6 0) .cse1) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-16 01:08:13,473 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) .cse1))) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse1)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse0))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (<= .cse1 0) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse8 0))) (or (and (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse2) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse4 (select |v_old(#valid)_AFTER_CALL_28| .cse4))) |v_old(#valid)_AFTER_CALL_28|)))) (and (exists ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse5 (select .cse8 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= (select .cse6 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) 0) (= (select (select |c_#memory_int| .cse5) 4) |c_ULTIMATE.start_main_~data~0#1|) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse7 (select |v_old(#valid)_AFTER_CALL_28| .cse7))) |v_old(#valid)_AFTER_CALL_28|)))) (= .cse2 .cse3))))) (= .cse9 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse9) (= (select .cse6 0) .cse1) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from true [2023-02-16 01:08:13,864 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) .cse3))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse5)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse3)) (.cse2 (select |c_#memory_$Pointer$.offset| .cse5))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse0 .cse1)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| (select .cse2 .cse1)) (<= .cse3 0) (let ((.cse4 (select .cse0 0))) (or (and (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse4) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse4)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse6) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse7 (select |v_old(#valid)_AFTER_CALL_28| .cse7))) |v_old(#valid)_AFTER_CALL_28|)))) (and (exists ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse8 (select .cse0 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (<= (+ .cse8 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 1) (= (select .cse2 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) 0) (= (select (select |c_#memory_int| .cse8) 4) |c_ULTIMATE.start_main_~data~0#1|) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse8)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse6) 0) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse9 (select |v_old(#valid)_AFTER_CALL_28| .cse9))) |v_old(#valid)_AFTER_CALL_28|)))) (= .cse4 .cse6)))) (= .cse1 0) (= (select .cse2 0) .cse3) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse3) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-16 01:08:13,868 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) .cse3))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse5)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse3)) (.cse2 (select |c_#memory_$Pointer$.offset| .cse5))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse0 .cse1)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| (select .cse2 .cse1)) (<= .cse3 0) (let ((.cse4 (select .cse0 0))) (or (and (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse4) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse4)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse6) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse7 (select |v_old(#valid)_AFTER_CALL_28| .cse7))) |v_old(#valid)_AFTER_CALL_28|)))) (and (exists ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse8 (select .cse0 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (<= (+ .cse8 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 1) (= (select .cse2 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) 0) (= (select (select |c_#memory_int| .cse8) 4) |c_ULTIMATE.start_main_~data~0#1|) (= 0 (select |v_old(#valid)_AFTER_CALL_28| .cse8)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse6) 0) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse9 (select |v_old(#valid)_AFTER_CALL_28| .cse9))) |v_old(#valid)_AFTER_CALL_28|)))) (= .cse4 .cse6)))) (= .cse1 0) (= (select .cse2 0) .cse3) (exists ((v_arrayElimIndex_63 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_201) 1) (<= (+ v_arrayElimIndex_63 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_63) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_27| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_27| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimCell_201) 0))) (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse3) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from true [2023-02-16 01:08:13,889 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:08:13,930 INFO L321 Elim1Store]: treesize reduction 89, result has 15.2 percent of original size [2023-02-16 01:08:13,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 394 treesize of output 182 [2023-02-16 01:08:13,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:13,974 INFO L321 Elim1Store]: treesize reduction 49, result has 19.7 percent of original size [2023-02-16 01:08:13,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 133 [2023-02-16 01:08:14,290 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| |c_ULTIMATE.start_main_#t~mem18#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_main_#t~mem18#1.offset|) (or (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (v_arrayElimIndex_78 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimIndex_78) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_old(#valid)_AFTER_CALL_28| .cse0))) |v_old(#valid)_AFTER_CALL_28|)))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem18#1.base|) (exists ((v_prenex_13 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_arrayElimCell_229 Int) (v_arrayElimIndex_78 Int)) (and (= 0 (select v_prenex_12 v_arrayElimCell_229)) (= (select (select |c_#memory_int| v_arrayElimCell_229) 4) |c_ULTIMATE.start_main_~data~0#1|) (= (select v_prenex_13 v_arrayElimIndex_78) 1) (= (select v_prenex_13 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (let ((.cse1 (@diff v_prenex_13 v_prenex_12))) (store v_prenex_13 .cse1 (select v_prenex_12 .cse1))) v_prenex_12) (= (select v_prenex_12 |c_ULTIMATE.start_main_#t~mem18#1.base|) 1))))) (<= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0)) is different from false [2023-02-16 01:08:14,292 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| |c_ULTIMATE.start_main_#t~mem18#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_main_#t~mem18#1.offset|) (or (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (v_arrayElimIndex_78 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimIndex_78) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_old(#valid)_AFTER_CALL_28| .cse0))) |v_old(#valid)_AFTER_CALL_28|)))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem18#1.base|) (exists ((v_prenex_13 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_arrayElimCell_229 Int) (v_arrayElimIndex_78 Int)) (and (= 0 (select v_prenex_12 v_arrayElimCell_229)) (= (select (select |c_#memory_int| v_arrayElimCell_229) 4) |c_ULTIMATE.start_main_~data~0#1|) (= (select v_prenex_13 v_arrayElimIndex_78) 1) (= (select v_prenex_13 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (let ((.cse1 (@diff v_prenex_13 v_prenex_12))) (store v_prenex_13 .cse1 (select v_prenex_12 .cse1))) v_prenex_12) (= (select v_prenex_12 |c_ULTIMATE.start_main_#t~mem18#1.base|) 1))))) (<= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0)) is different from true [2023-02-16 01:08:14,315 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_ULTIMATE.start_main_#t~mem18#1.base_13| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (v_arrayElimIndex_78 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_#t~mem18#1.base_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimIndex_78) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_main_#t~mem18#1.base_13|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_old(#valid)_AFTER_CALL_28| .cse0))) |v_old(#valid)_AFTER_CALL_28|))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) is different from false [2023-02-16 01:08:14,317 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_ULTIMATE.start_main_#t~mem18#1.base_13| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (v_arrayElimIndex_78 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_#t~mem18#1.base_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimIndex_78) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_main_#t~mem18#1.base_13|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_old(#valid)_AFTER_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_old(#valid)_AFTER_CALL_28| .cse0))) |v_old(#valid)_AFTER_CALL_28|))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) is different from true [2023-02-16 01:08:14,339 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:08:14,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-16 01:08:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2023-02-16 01:08:14,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:22,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:08:22,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3021 treesize of output 2998 [2023-02-16 01:08:22,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:08:22,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26989 treesize of output 26548 [2023-02-16 01:08:22,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26545 treesize of output 24765 [2023-02-16 01:08:22,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26557 treesize of output 24332 [2023-02-16 01:08:26,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 3 [2023-02-16 01:08:28,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 3 [2023-02-16 01:08:28,886 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 01:08:28,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 3 [2023-02-16 01:08:28,907 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 01:08:28,934 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 01:08:28,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 3 [2023-02-16 01:08:29,023 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 01:08:29,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 3 [2023-02-16 01:08:29,050 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 01:08:29,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 3