./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:49:25,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:49:25,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:49:25,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:49:25,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:49:25,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:49:25,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:49:25,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:49:25,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:49:25,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:49:25,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:49:25,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:49:25,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:49:25,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:49:25,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:49:25,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:49:25,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:49:25,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:49:25,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:49:25,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:49:25,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:49:25,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:49:25,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:49:25,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:49:25,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:49:25,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:49:25,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:49:25,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:49:25,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:49:25,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:49:25,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:49:25,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:49:25,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:49:25,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:49:25,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:49:25,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:49:25,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:49:25,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:49:25,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:49:25,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:49:25,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:49:25,510 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:49:25,527 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:49:25,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:49:25,528 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:49:25,528 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:49:25,529 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:49:25,529 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:49:25,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:49:25,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:49:25,530 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:49:25,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:49:25,532 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:49:25,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:49:25,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:49:25,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:49:25,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:49:25,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:49:25,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:49:25,533 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:49:25,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:49:25,533 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:49:25,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:49:25,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:49:25,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:49:25,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:49:25,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:49:25,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:49:25,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:49:25,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:49:25,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:49:25,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:49:25,535 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:49:25,535 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:49:25,535 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:49:25,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:49:25,536 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:49:25,536 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2023-02-15 19:49:25,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:49:25,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:49:25,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:49:25,734 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:49:25,734 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:49:25,735 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-02-15 19:49:26,647 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:49:26,851 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:49:26,853 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-02-15 19:49:26,867 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3d997590/cb964291914f4a0ca16fc4e3bcca1c10/FLAG6e45c1d91 [2023-02-15 19:49:26,878 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3d997590/cb964291914f4a0ca16fc4e3bcca1c10 [2023-02-15 19:49:26,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:49:26,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:49:26,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:49:26,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:49:26,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:49:26,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:49:26" (1/1) ... [2023-02-15 19:49:26,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b952e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:26, skipping insertion in model container [2023-02-15 19:49:26,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:49:26" (1/1) ... [2023-02-15 19:49:26,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:49:26,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:49:27,112 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/sll2n_append_equal.i[24197,24210] [2023-02-15 19:49:27,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:49:27,120 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:49:27,170 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/sll2n_append_equal.i[24197,24210] [2023-02-15 19:49:27,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:49:27,189 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:49:27,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:27 WrapperNode [2023-02-15 19:49:27,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:49:27,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:49:27,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:49:27,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:49:27,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:27" (1/1) ... [2023-02-15 19:49:27,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:27" (1/1) ... [2023-02-15 19:49:27,226 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2023-02-15 19:49:27,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:49:27,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:49:27,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:49:27,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:49:27,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:27" (1/1) ... [2023-02-15 19:49:27,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:27" (1/1) ... [2023-02-15 19:49:27,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:27" (1/1) ... [2023-02-15 19:49:27,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:27" (1/1) ... [2023-02-15 19:49:27,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:27" (1/1) ... [2023-02-15 19:49:27,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:27" (1/1) ... [2023-02-15 19:49:27,245 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:27" (1/1) ... [2023-02-15 19:49:27,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:27" (1/1) ... [2023-02-15 19:49:27,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:49:27,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:49:27,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:49:27,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:49:27,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:27" (1/1) ... [2023-02-15 19:49:27,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:49:27,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:27,269 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-15 19:49:27,272 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-15 19:49:27,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:49:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:49:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 19:49:27,296 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 19:49:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:49:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:49:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 19:49:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:49:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:49:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:49:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 19:49:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:49:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:49:27,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:49:27,444 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:49:27,446 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:49:27,600 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:49:27,605 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:49:27,605 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 19:49:27,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:49:27 BoogieIcfgContainer [2023-02-15 19:49:27,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:49:27,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:49:27,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:49:27,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:49:27,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:49:26" (1/3) ... [2023-02-15 19:49:27,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66350e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:49:27, skipping insertion in model container [2023-02-15 19:49:27,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:27" (2/3) ... [2023-02-15 19:49:27,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66350e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:49:27, skipping insertion in model container [2023-02-15 19:49:27,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:49:27" (3/3) ... [2023-02-15 19:49:27,612 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-02-15 19:49:27,628 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:49:27,629 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:49:27,660 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:49:27,665 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;@19bb7a9f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:49:27,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:49:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 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-15 19:49:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 19:49:27,673 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:27,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:27,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:27,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:27,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2128592868, now seen corresponding path program 1 times [2023-02-15 19:49:27,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:27,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266473882] [2023-02-15 19:49:27,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:27,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:49:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:49:27,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:27,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266473882] [2023-02-15 19:49:27,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266473882] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:49:27,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:49:27,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:49:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440956308] [2023-02-15 19:49:27,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:49:27,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:49:27,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:27,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:49:27,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:49:27,916 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:49:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:27,954 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2023-02-15 19:49:27,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:49:27,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-15 19:49:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:27,959 INFO L225 Difference]: With dead ends: 56 [2023-02-15 19:49:27,960 INFO L226 Difference]: Without dead ends: 25 [2023-02-15 19:49:27,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:49:27,964 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:27,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:49:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-15 19:49:27,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-15 19:49:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-15 19:49:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-02-15 19:49:27,986 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2023-02-15 19:49:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:27,986 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-02-15 19:49:27,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:49:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-02-15 19:49:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 19:49:27,987 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:27,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:27,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:49:27,988 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:27,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:27,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1341887012, now seen corresponding path program 1 times [2023-02-15 19:49:27,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:27,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611819637] [2023-02-15 19:49:27,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:27,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:28,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:49:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:49:28,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:28,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611819637] [2023-02-15 19:49:28,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611819637] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:49:28,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:49:28,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:49:28,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276487834] [2023-02-15 19:49:28,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:49:28,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:49:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:28,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:49:28,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:49:28,107 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:49:28,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:28,135 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2023-02-15 19:49:28,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:49:28,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-15 19:49:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:28,137 INFO L225 Difference]: With dead ends: 48 [2023-02-15 19:49:28,139 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 19:49:28,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:49:28,144 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:28,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:49:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 19:49:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-02-15 19:49:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-15 19:49:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-02-15 19:49:28,162 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2023-02-15 19:49:28,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:28,162 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-02-15 19:49:28,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:49:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-02-15 19:49:28,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 19:49:28,163 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:28,163 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, 1, 1] [2023-02-15 19:49:28,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:49:28,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:28,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2097266908, now seen corresponding path program 1 times [2023-02-15 19:49:28,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:28,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827757546] [2023-02-15 19:49:28,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:28,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:28,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 19:49:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:49:28,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:28,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827757546] [2023-02-15 19:49:28,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827757546] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:28,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960378746] [2023-02-15 19:49:28,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:28,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:28,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:28,304 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-15 19:49:28,305 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-15 19:49:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:28,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 19:49:28,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:49:28,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:49:28,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960378746] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:49:28,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:49:28,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-15 19:49:28,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859245419] [2023-02-15 19:49:28,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:49:28,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:49:28,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:28,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:49:28,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:49:28,514 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 19:49:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:28,570 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2023-02-15 19:49:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:49:28,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-02-15 19:49:28,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:28,571 INFO L225 Difference]: With dead ends: 49 [2023-02-15 19:49:28,571 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 19:49:28,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:49:28,574 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:28,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 88 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:49:28,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 19:49:28,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-15 19:49:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-15 19:49:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-15 19:49:28,582 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2023-02-15 19:49:28,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:28,582 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-15 19:49:28,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 19:49:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-15 19:49:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 19:49:28,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:28,585 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:28,594 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-15 19:49:28,789 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-15 19:49:28,790 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:28,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:28,790 INFO L85 PathProgramCache]: Analyzing trace with hash -867054116, now seen corresponding path program 2 times [2023-02-15 19:49:28,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:28,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480149886] [2023-02-15 19:49:28,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:28,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:28,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:28,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:49:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:29,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:49:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 19:49:29,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:29,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480149886] [2023-02-15 19:49:29,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480149886] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:49:29,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:49:29,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 19:49:29,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861688711] [2023-02-15 19:49:29,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:49:29,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 19:49:29,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:29,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 19:49:29,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 19:49:29,084 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:49:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:29,173 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2023-02-15 19:49:29,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 19:49:29,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2023-02-15 19:49:29,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:29,176 INFO L225 Difference]: With dead ends: 43 [2023-02-15 19:49:29,176 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 19:49:29,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-02-15 19:49:29,178 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:29,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 133 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:49:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 19:49:29,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2023-02-15 19:49:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-15 19:49:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-02-15 19:49:29,182 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 35 [2023-02-15 19:49:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:29,183 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-02-15 19:49:29,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:49:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-02-15 19:49:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 19:49:29,184 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:29,184 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:29,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 19:49:29,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash -867052442, now seen corresponding path program 1 times [2023-02-15 19:49:29,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:29,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411807722] [2023-02-15 19:49:29,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:29,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:29,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:29,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:49:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:29,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:49:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:49:29,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:29,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411807722] [2023-02-15 19:49:29,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411807722] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:29,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592300372] [2023-02-15 19:49:29,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:29,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:29,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:29,565 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-15 19:49:29,568 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-15 19:49:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:29,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 19:49:29,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:29,925 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 17 treesize of output 9 [2023-02-15 19:49:29,970 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_405 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_405))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-02-15 19:49:30,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:30,033 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 24 treesize of output 24 [2023-02-15 19:49:30,069 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 25 treesize of output 13 [2023-02-15 19:49:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2023-02-15 19:49:30,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:30,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592300372] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:30,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:49:30,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-02-15 19:49:30,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577397325] [2023-02-15 19:49:30,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:49:30,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 19:49:30,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:30,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 19:49:30,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=476, Unknown=5, NotChecked=44, Total=600 [2023-02-15 19:49:30,198 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:49:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:30,478 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2023-02-15 19:49:30,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 19:49:30,478 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2023-02-15 19:49:30,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:30,479 INFO L225 Difference]: With dead ends: 37 [2023-02-15 19:49:30,479 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 19:49:30,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=734, Unknown=5, NotChecked=56, Total=930 [2023-02-15 19:49:30,480 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 66 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:30,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 149 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2023-02-15 19:49:30,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 19:49:30,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-15 19:49:30,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 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-15 19:49:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-02-15 19:49:30,484 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 35 [2023-02-15 19:49:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:30,484 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-02-15 19:49:30,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:49:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-02-15 19:49:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 19:49:30,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:30,485 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:30,493 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-15 19:49:30,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:30,691 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:30,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1386356248, now seen corresponding path program 1 times [2023-02-15 19:49:30,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:30,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533066478] [2023-02-15 19:49:30,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:31,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:31,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:49:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:31,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:49:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:49:31,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:31,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533066478] [2023-02-15 19:49:31,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533066478] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:31,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090286505] [2023-02-15 19:49:31,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:31,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:31,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:31,214 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-15 19:49:31,216 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-15 19:49:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:31,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 19:49:31,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:31,496 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-15 19:49:31,538 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_557 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_557))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 19:49:31,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:31,552 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-15 19:49:31,615 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2023-02-15 19:49:31,616 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 35 [2023-02-15 19:49:31,623 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-15 19:49:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2023-02-15 19:49:31,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:37,791 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|v_node_create_~temp~0#1.base_16| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_558 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_16| v_ArrVal_562))) (let ((.cse0 (select .cse2 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 (select (select (store .cse2 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_558)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (< |v_node_create_~temp~0#1.base_16| |c_#StackHeapBarrier|)))))) is different from false [2023-02-15 19:49:37,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090286505] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:37,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:49:37,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2023-02-15 19:49:37,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032354791] [2023-02-15 19:49:37,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:49:37,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 19:49:37,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:37,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 19:49:37,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=780, Unknown=5, NotChecked=114, Total=992 [2023-02-15 19:49:37,794 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 23 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 19:49:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:38,429 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-02-15 19:49:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 19:49:38,429 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 23 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2023-02-15 19:49:38,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:38,430 INFO L225 Difference]: With dead ends: 50 [2023-02-15 19:49:38,430 INFO L226 Difference]: Without dead ends: 47 [2023-02-15 19:49:38,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=298, Invalid=1685, Unknown=5, NotChecked=174, Total=2162 [2023-02-15 19:49:38,431 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 260 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:38,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 194 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 324 Invalid, 0 Unknown, 48 Unchecked, 0.2s Time] [2023-02-15 19:49:38,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-15 19:49:38,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2023-02-15 19:49:38,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-15 19:49:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-02-15 19:49:38,436 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 38 [2023-02-15 19:49:38,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:38,436 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-02-15 19:49:38,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 23 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 19:49:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-02-15 19:49:38,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 19:49:38,439 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:38,440 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:38,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 19:49:38,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:38,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:38,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:38,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1386357922, now seen corresponding path program 1 times [2023-02-15 19:49:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:38,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339784033] [2023-02-15 19:49:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:39,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:39,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:49:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:39,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:49:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:49:39,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:39,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339784033] [2023-02-15 19:49:39,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339784033] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:39,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694284070] [2023-02-15 19:49:39,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:39,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:39,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:39,465 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-15 19:49:39,485 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-15 19:49:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:39,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-15 19:49:39,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:39,761 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-15 19:49:39,848 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 13 treesize of output 9 [2023-02-15 19:49:39,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:49:39,993 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 1 case distinctions, treesize of input 22 treesize of output 13 [2023-02-15 19:49:40,001 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-15 19:49:40,079 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_714 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_714))) (exists ((v_ArrVal_715 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_715))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 19:49:40,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:40,112 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:49:40,113 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 28 treesize of output 34 [2023-02-15 19:49:40,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:40,119 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-15 19:49:40,126 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 19:49:40,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 19:49:40,162 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-15 19:49:40,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:49:40,200 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 1 case distinctions, treesize of input 24 treesize of output 11 [2023-02-15 19:49:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-02-15 19:49:40,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:40,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694284070] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:40,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:49:40,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2023-02-15 19:49:40,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150191521] [2023-02-15 19:49:40,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:49:40,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 19:49:40,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:40,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 19:49:40,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1170, Unknown=2, NotChecked=68, Total=1332 [2023-02-15 19:49:40,385 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 34 states, 32 states have (on average 1.90625) internal successors, (61), 29 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 19:49:41,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:41,446 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-02-15 19:49:41,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 19:49:41,447 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.90625) internal successors, (61), 29 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2023-02-15 19:49:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:41,448 INFO L225 Difference]: With dead ends: 42 [2023-02-15 19:49:41,448 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 19:49:41,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=233, Invalid=2121, Unknown=2, NotChecked=94, Total=2450 [2023-02-15 19:49:41,450 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 67 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:41,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 292 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 599 Invalid, 0 Unknown, 35 Unchecked, 0.4s Time] [2023-02-15 19:49:41,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 19:49:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-02-15 19:49:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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-15 19:49:41,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-02-15 19:49:41,462 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 38 [2023-02-15 19:49:41,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:41,462 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-02-15 19:49:41,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.90625) internal successors, (61), 29 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 19:49:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-02-15 19:49:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 19:49:41,467 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:41,467 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:41,481 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-15 19:49:41,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:41,677 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:41,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash 403581565, now seen corresponding path program 1 times [2023-02-15 19:49:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:41,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881143473] [2023-02-15 19:49:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:41,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:42,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:42,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:49:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:42,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:49:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:49:43,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:43,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881143473] [2023-02-15 19:49:43,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881143473] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:43,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285964522] [2023-02-15 19:49:43,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:43,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:43,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:43,153 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-15 19:49:43,155 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-15 19:49:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:43,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 113 conjunts are in the unsatisfiable core [2023-02-15 19:49:43,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:43,386 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-15 19:49:43,539 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-15 19:49:43,602 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-15 19:49:43,668 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:49:43,668 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-15 19:49:43,741 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 13 treesize of output 9 [2023-02-15 19:49:43,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:43,762 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 21 treesize of output 20 [2023-02-15 19:49:43,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:49:43,964 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 1 case distinctions, treesize of input 61 treesize of output 28 [2023-02-15 19:49:43,967 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-15 19:49:43,971 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-15 19:49:44,051 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_880 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_880))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_878 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_878))) (exists ((v_ArrVal_879 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_879))))) is different from true [2023-02-15 19:49:44,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:44,091 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:49:44,092 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-15 19:49:44,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:44,100 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-15 19:49:44,118 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:49:44,119 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-15 19:49:44,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:44,123 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-15 19:49:44,366 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 19:49:44,366 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 101 treesize of output 84 [2023-02-15 19:49:44,375 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:49:44,375 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 48 treesize of output 49 [2023-02-15 19:49:44,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:44,383 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 32 treesize of output 34 [2023-02-15 19:49:44,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:49:44,442 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 1 case distinctions, treesize of input 48 treesize of output 23 [2023-02-15 19:49:44,446 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-15 19:49:44,481 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-15 19:49:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-15 19:49:44,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:44,631 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_882) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_883) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_884) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:49:44,640 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_882) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_883) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_884) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:49:44,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285964522] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:44,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:49:44,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 46 [2023-02-15 19:49:44,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468826776] [2023-02-15 19:49:44,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:49:44,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 19:49:44,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:44,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 19:49:44,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1997, Unknown=31, NotChecked=276, Total=2450 [2023-02-15 19:49:44,786 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 38 states have internal predecessors, (65), 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-15 19:49:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:47,061 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2023-02-15 19:49:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 19:49:47,064 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 38 states have internal predecessors, (65), 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 40 [2023-02-15 19:49:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:47,065 INFO L225 Difference]: With dead ends: 48 [2023-02-15 19:49:47,065 INFO L226 Difference]: Without dead ends: 46 [2023-02-15 19:49:47,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=455, Invalid=3686, Unknown=31, NotChecked=384, Total=4556 [2023-02-15 19:49:47,067 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 247 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:47,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 322 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 741 Invalid, 0 Unknown, 47 Unchecked, 0.5s Time] [2023-02-15 19:49:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-15 19:49:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2023-02-15 19:49:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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-15 19:49:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2023-02-15 19:49:47,077 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 40 [2023-02-15 19:49:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:47,078 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-02-15 19:49:47,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 38 states have internal predecessors, (65), 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-15 19:49:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2023-02-15 19:49:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 19:49:47,079 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:47,079 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:47,086 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-15 19:49:47,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:47,285 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:47,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1294860110, now seen corresponding path program 1 times [2023-02-15 19:49:47,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:47,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052464178] [2023-02-15 19:49:47,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:47,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:48,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:48,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:49:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:48,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:49:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:49:48,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:48,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052464178] [2023-02-15 19:49:48,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052464178] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:48,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380708475] [2023-02-15 19:49:48,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:48,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:48,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:48,676 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-15 19:49:48,679 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-15 19:49:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:48,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 87 conjunts are in the unsatisfiable core [2023-02-15 19:49:48,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:48,803 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-15 19:49:48,813 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-15 19:49:48,903 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:49:48,904 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 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 19:49:48,991 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:49:48,991 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 1 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:49:49,112 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-15 19:49:49,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 19:49:49,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:49:49,378 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:49:49,378 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 67 treesize of output 30 [2023-02-15 19:49:49,383 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-15 19:49:49,387 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:49:49,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 19:49:49,459 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1049 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1049))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_1048 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1048))) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0))) is different from true [2023-02-15 19:49:49,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:49,478 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-15 19:49:49,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:49,488 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:49:49,489 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 73 treesize of output 61 [2023-02-15 19:49:49,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:49,507 INFO L321 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2023-02-15 19:49:49,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 19:49:49,707 INFO L321 Elim1Store]: treesize reduction 70, result has 33.3 percent of original size [2023-02-15 19:49:49,708 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 66 [2023-02-15 19:49:49,722 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 19:49:49,722 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 21 treesize of output 20 [2023-02-15 19:49:49,768 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-15 19:49:49,825 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:49:49,825 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 56 treesize of output 23 [2023-02-15 19:49:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-02-15 19:49:49,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:50,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380708475] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:50,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:49:50,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 44 [2023-02-15 19:49:50,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358165726] [2023-02-15 19:49:50,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:49:50,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 19:49:50,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:50,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 19:49:50,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2109, Unknown=1, NotChecked=92, Total=2352 [2023-02-15 19:49:50,252 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 44 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 36 states have internal predecessors, (64), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 19:49:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:53,946 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2023-02-15 19:49:53,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 19:49:53,946 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 36 states have internal predecessors, (64), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2023-02-15 19:49:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:53,948 INFO L225 Difference]: With dead ends: 60 [2023-02-15 19:49:53,948 INFO L226 Difference]: Without dead ends: 57 [2023-02-15 19:49:53,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=679, Invalid=4580, Unknown=1, NotChecked=142, Total=5402 [2023-02-15 19:49:53,951 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 426 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:53,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 390 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 745 Invalid, 0 Unknown, 51 Unchecked, 0.4s Time] [2023-02-15 19:49:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-15 19:49:53,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2023-02-15 19:49:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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-15 19:49:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2023-02-15 19:49:53,965 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 42 [2023-02-15 19:49:53,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:53,966 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2023-02-15 19:49:53,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 36 states have internal predecessors, (64), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 19:49:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2023-02-15 19:49:53,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 19:49:53,968 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:53,968 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:53,981 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-15 19:49:54,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:54,174 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:54,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:54,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1294861784, now seen corresponding path program 1 times [2023-02-15 19:49:54,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:54,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292314927] [2023-02-15 19:49:54,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:54,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:55,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:49:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:55,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:49:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:49:55,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:55,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292314927] [2023-02-15 19:49:55,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292314927] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:55,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224054902] [2023-02-15 19:49:55,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:55,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:55,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:55,835 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-15 19:49:55,837 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-15 19:49:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:55,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 152 conjunts are in the unsatisfiable core [2023-02-15 19:49:55,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:56,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-15 19:49:56,106 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-15 19:49:56,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:56,215 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 21 treesize of output 20 [2023-02-15 19:49:56,305 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-15 19:49:56,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-15 19:49:56,502 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:49:56,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:49:56,517 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-15 19:49:56,608 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 13 treesize of output 9 [2023-02-15 19:49:56,620 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 20 treesize of output 22 [2023-02-15 19:49:56,627 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 13 treesize of output 9 [2023-02-15 19:49:56,922 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:49:56,922 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 1 case distinctions, treesize of input 103 treesize of output 46 [2023-02-15 19:49:56,927 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-15 19:49:56,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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-15 19:49:56,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:56,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-02-15 19:49:57,053 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1222 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1222))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1223 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1223))) (exists ((v_ArrVal_1224 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_1224))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 19:49:57,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:57,095 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:49:57,095 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 113 treesize of output 87 [2023-02-15 19:49:57,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:57,106 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 22 treesize of output 24 [2023-02-15 19:49:57,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:57,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:57,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:57,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 19:49:57,128 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:49:57,129 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 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 19:49:57,663 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:49:57,692 INFO L321 Elim1Store]: treesize reduction 135, result has 17.2 percent of original size [2023-02-15 19:49:57,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 271 treesize of output 137 [2023-02-15 19:49:57,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:57,723 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2023-02-15 19:49:57,723 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 209 treesize of output 155 [2023-02-15 19:49:57,733 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 43 treesize of output 34 [2023-02-15 19:49:57,892 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:49:57,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:57,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:49:57,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 59 [2023-02-15 19:49:57,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:57,902 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 19:49:57,902 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 1 case distinctions, treesize of input 28 treesize of output 18 [2023-02-15 19:49:57,996 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-15 19:49:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-15 19:49:58,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:50:13,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224054902] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:50:13,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:50:13,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2023-02-15 19:50:13,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894962290] [2023-02-15 19:50:13,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:50:13,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 19:50:13,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:50:13,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 19:50:13,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3202, Unknown=5, NotChecked=114, Total=3540 [2023-02-15 19:50:13,666 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 52 states, 50 states have (on average 1.4) internal successors, (70), 44 states have internal predecessors, (70), 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-15 19:50:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:50:18,131 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2023-02-15 19:50:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 19:50:18,132 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.4) internal successors, (70), 44 states have internal predecessors, (70), 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 42 [2023-02-15 19:50:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:50:18,132 INFO L225 Difference]: With dead ends: 52 [2023-02-15 19:50:18,132 INFO L226 Difference]: Without dead ends: 50 [2023-02-15 19:50:18,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=660, Invalid=5501, Unknown=5, NotChecked=154, Total=6320 [2023-02-15 19:50:18,134 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 252 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 19:50:18,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 300 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 838 Invalid, 0 Unknown, 45 Unchecked, 0.7s Time] [2023-02-15 19:50:18,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-15 19:50:18,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2023-02-15 19:50:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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-15 19:50:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-02-15 19:50:18,143 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 42 [2023-02-15 19:50:18,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:50:18,144 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-02-15 19:50:18,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.4) internal successors, (70), 44 states have internal predecessors, (70), 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-15 19:50:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-02-15 19:50:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 19:50:18,144 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:50:18,144 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:50:18,152 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-15 19:50:18,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:50:18,349 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:50:18,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:50:18,349 INFO L85 PathProgramCache]: Analyzing trace with hash 848307608, now seen corresponding path program 2 times [2023-02-15 19:50:18,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:50:18,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198742317] [2023-02-15 19:50:18,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:50:18,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:50:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:19,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:50:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:19,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:50:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:19,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:50:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:50:20,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:50:20,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198742317] [2023-02-15 19:50:20,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198742317] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:50:20,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875512745] [2023-02-15 19:50:20,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:50:20,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:50:20,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:50:20,009 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-15 19:50:20,010 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-15 19:50:20,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:50:20,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:50:20,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 147 conjunts are in the unsatisfiable core [2023-02-15 19:50:20,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:50:20,228 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-15 19:50:20,343 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 13 treesize of output 9 [2023-02-15 19:50:20,520 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-15 19:50:20,611 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 19:50:20,611 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 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 19:50:20,616 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 7 treesize of output 3 [2023-02-15 19:50:20,645 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:50:20,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-15 19:50:20,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:20,720 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 21 treesize of output 20 [2023-02-15 19:50:20,734 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 23 treesize of output 22 [2023-02-15 19:50:20,738 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 13 treesize of output 9 [2023-02-15 19:50:21,050 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-15 19:50:21,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 56 [2023-02-15 19:50:21,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:21,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-15 19:50:21,072 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-15 19:50:21,076 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-15 19:50:21,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:21,490 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 19:50:21,490 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 98 treesize of output 88 [2023-02-15 19:50:21,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:21,497 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-15 19:50:21,512 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:50:21,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 19:50:21,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:21,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:21,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-02-15 19:50:22,209 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:50:22,282 INFO L321 Elim1Store]: treesize reduction 302, result has 15.4 percent of original size [2023-02-15 19:50:22,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 20 case distinctions, treesize of input 315 treesize of output 145 [2023-02-15 19:50:22,289 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-15 19:50:22,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:22,303 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 19:50:22,303 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 104 treesize of output 86 [2023-02-15 19:50:22,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:22,484 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-02-15 19:50:22,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 116 [2023-02-15 19:50:22,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:22,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:50:22,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 133 [2023-02-15 19:50:22,642 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-15 19:50:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:50:22,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:50:22,707 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1406 Int)) (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1410) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_1406)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:50:23,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875512745] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:50:23,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:50:23,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51 [2023-02-15 19:50:23,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204848702] [2023-02-15 19:50:23,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:50:23,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 19:50:23,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:50:23,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 19:50:23,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3112, Unknown=7, NotChecked=112, Total=3422 [2023-02-15 19:50:23,598 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 42 states have internal predecessors, (69), 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-15 19:50:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:50:27,728 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2023-02-15 19:50:27,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 19:50:27,733 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 42 states have internal predecessors, (69), 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 42 [2023-02-15 19:50:27,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:50:27,734 INFO L225 Difference]: With dead ends: 86 [2023-02-15 19:50:27,734 INFO L226 Difference]: Without dead ends: 84 [2023-02-15 19:50:27,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=499, Invalid=5818, Unknown=7, NotChecked=156, Total=6480 [2023-02-15 19:50:27,736 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 131 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 19:50:27,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 473 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 19:50:27,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-15 19:50:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2023-02-15 19:50:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 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-15 19:50:27,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2023-02-15 19:50:27,753 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 42 [2023-02-15 19:50:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:50:27,753 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2023-02-15 19:50:27,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 42 states have internal predecessors, (69), 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-15 19:50:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2023-02-15 19:50:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 19:50:27,754 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:50:27,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:50:27,760 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-15 19:50:27,958 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,SelfDestructingSolverStorable10 [2023-02-15 19:50:27,958 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:50:27,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:50:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1178308631, now seen corresponding path program 2 times [2023-02-15 19:50:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:50:27,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230734684] [2023-02-15 19:50:27,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:50:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:50:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:28,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:50:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:29,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:50:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:29,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:50:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:50:29,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:50:29,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230734684] [2023-02-15 19:50:29,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230734684] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:50:29,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375551873] [2023-02-15 19:50:29,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:50:29,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:50:29,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:50:29,277 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-15 19:50:29,279 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-15 19:50:29,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:50:29,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:50:29,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 152 conjunts are in the unsatisfiable core [2023-02-15 19:50:29,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:50:29,432 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-15 19:50:29,468 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-15 19:50:29,577 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:50:29,577 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-15 19:50:29,674 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-15 19:50:29,720 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 14 treesize of output 15 [2023-02-15 19:50:29,725 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 14 treesize of output 15 [2023-02-15 19:50:29,802 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 19:50:29,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 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-15 19:50:29,881 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:50:29,882 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 21 treesize of output 13 [2023-02-15 19:50:29,889 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:50:29,889 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 21 treesize of output 13 [2023-02-15 19:50:30,150 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:50:30,151 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 1 case distinctions, treesize of input 78 treesize of output 37 [2023-02-15 19:50:30,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 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-15 19:50:30,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-15 19:50:30,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:30,320 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:50:30,320 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 84 treesize of output 70 [2023-02-15 19:50:30,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:30,334 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 19:50:30,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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-15 19:50:30,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:30,357 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:50:30,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 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-15 19:50:30,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:30,966 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:50:30,988 INFO L321 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2023-02-15 19:50:30,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 207 treesize of output 105 [2023-02-15 19:50:31,013 INFO L321 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2023-02-15 19:50:31,013 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 303 treesize of output 197 [2023-02-15 19:50:31,366 INFO L321 Elim1Store]: treesize reduction 120, result has 54.0 percent of original size [2023-02-15 19:50:31,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 488 treesize of output 440 [2023-02-15 19:50:32,804 INFO L321 Elim1Store]: treesize reduction 132, result has 38.0 percent of original size [2023-02-15 19:50:32,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 268 treesize of output 174 [2023-02-15 19:50:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:50:33,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:50:34,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375551873] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:50:34,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:50:34,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 50 [2023-02-15 19:50:34,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816260521] [2023-02-15 19:50:34,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:50:34,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-15 19:50:34,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:50:34,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-15 19:50:34,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3463, Unknown=0, NotChecked=0, Total=3660 [2023-02-15 19:50:34,765 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 50 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 41 states have internal predecessors, (70), 6 states have call successors, (6), 3 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-15 19:50:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:50:37,970 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2023-02-15 19:50:37,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 19:50:37,971 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 41 states have internal predecessors, (70), 6 states have call successors, (6), 3 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 44 [2023-02-15 19:50:37,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:50:37,972 INFO L225 Difference]: With dead ends: 74 [2023-02-15 19:50:37,973 INFO L226 Difference]: Without dead ends: 71 [2023-02-15 19:50:37,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=577, Invalid=5585, Unknown=0, NotChecked=0, Total=6162 [2023-02-15 19:50:37,974 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 189 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:50:37,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 433 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 19:50:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-15 19:50:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2023-02-15 19:50:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 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-15 19:50:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2023-02-15 19:50:37,996 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 44 [2023-02-15 19:50:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:50:37,996 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2023-02-15 19:50:37,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 41 states have internal predecessors, (70), 6 states have call successors, (6), 3 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-15 19:50:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2023-02-15 19:50:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 19:50:37,997 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:50:37,997 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:50:38,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 19:50:38,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:50:38,203 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:50:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:50:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1178306957, now seen corresponding path program 2 times [2023-02-15 19:50:38,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:50:38,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801662404] [2023-02-15 19:50:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:50:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:50:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:39,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:50:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:39,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:50:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:39,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:50:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:50:39,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:50:39,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801662404] [2023-02-15 19:50:39,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801662404] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:50:39,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700256816] [2023-02-15 19:50:39,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:50:39,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:50:39,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:50:39,848 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:50:39,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 19:50:40,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:50:40,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:50:40,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 167 conjunts are in the unsatisfiable core [2023-02-15 19:50:40,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:50:40,050 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-15 19:50:40,199 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-15 19:50:40,314 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0)) is different from false [2023-02-15 19:50:40,316 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0)) is different from true [2023-02-15 19:50:40,329 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 13 treesize of output 9 [2023-02-15 19:50:40,334 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 13 treesize of output 9 [2023-02-15 19:50:40,345 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:50:40,347 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 19:50:40,409 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-15 19:50:40,411 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from true [2023-02-15 19:50:40,441 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|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~data#1| |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0)))) is different from false [2023-02-15 19:50:40,443 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|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~data#1| |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0)))) is different from true [2023-02-15 19:50:40,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:50:40,460 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 1 case distinctions, treesize of input 56 treesize of output 31 [2023-02-15 19:50:40,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:50:40,469 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 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:50:40,483 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|)) is different from false [2023-02-15 19:50:40,485 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|)) is different from true [2023-02-15 19:50:40,514 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|)) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_~data#1| |c_node_create_#in~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from false [2023-02-15 19:50:40,516 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|)) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_~data#1| |c_node_create_#in~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-15 19:50:40,560 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-15 19:50:40,583 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 0) |c_node_create_#in~data#1|) (exists ((v_ArrVal_1751 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_1751))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1749 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1749))) (= 0 (select |c_old(#valid)| |c_node_create_#res#1.base|))) is different from false [2023-02-15 19:50:40,586 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 0) |c_node_create_#in~data#1|) (exists ((v_ArrVal_1751 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_1751))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1749 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1749))) (= 0 (select |c_old(#valid)| |c_node_create_#res#1.base|))) is different from true [2023-02-15 19:50:40,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:40,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:40,631 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:50:40,631 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 30 [2023-02-15 19:50:40,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:40,647 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:50:40,647 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 62 treesize of output 58 [2023-02-15 19:50:40,696 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|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (<= (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3))) |v_#valid_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0)))) is different from false [2023-02-15 19:50:40,699 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|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (<= (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3))) |v_#valid_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0)))) is different from true [2023-02-15 19:50:40,763 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|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-02-15 19:50:40,766 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|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|)))) is different from true [2023-02-15 19:50:40,827 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|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1))) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-02-15 19:50:40,830 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|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1))) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|)))) is different from true [2023-02-15 19:50:40,941 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse4)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ .cse7 4)) (.cse6 (select .cse0 4)) (.cse2 (select |c_#memory_$Pointer$.offset| .cse4))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse0 .cse1)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse2 .cse1)) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1))) (<= (+ .cse6 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 0) (= (select .cse2 4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2023-02-15 19:50:40,945 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse4)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ .cse7 4)) (.cse6 (select .cse0 4)) (.cse2 (select |c_#memory_$Pointer$.offset| .cse4))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse0 .cse1)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse2 .cse1)) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1))) (<= (+ .cse6 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 0) (= (select .cse2 4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|))))) is different from true [2023-02-15 19:50:41,013 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|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (= (select .cse7 4) 0))))) is different from false [2023-02-15 19:50:41,017 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|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (= (select .cse7 4) 0))))) is different from true [2023-02-15 19:50:41,087 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|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= (select .cse7 4) 0))))) is different from false [2023-02-15 19:50:41,090 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|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= (select .cse7 4) 0))))) is different from true [2023-02-15 19:50:41,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:41,113 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:50:41,136 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2023-02-15 19:50:41,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 6 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 127 [2023-02-15 19:50:41,167 INFO L321 Elim1Store]: treesize reduction 172, result has 11.3 percent of original size [2023-02-15 19:50:41,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 288 treesize of output 172 [2023-02-15 19:50:41,196 INFO L321 Elim1Store]: treesize reduction 93, result has 49.5 percent of original size [2023-02-15 19:50:41,196 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 62 treesize of output 116 [2023-02-15 19:50:41,201 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-15 19:50:41,218 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ .cse5 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse3) .cse8)) (.cse7 (+ .cse6 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) .cse7))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse2)) (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_30| .cse4))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0))) (= .cse5 0) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse6 0) (or (= (select (select |c_#memory_int| .cse2) 0) |c_ULTIMATE.start_main_~data~0#1|) (= .cse2 .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse7) 0))))))) is different from false [2023-02-15 19:50:41,221 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ .cse5 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse3) .cse8)) (.cse7 (+ .cse6 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) .cse7))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse2)) (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_30| .cse4))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0))) (= .cse5 0) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse6 0) (or (= (select (select |c_#memory_int| .cse2) 0) |c_ULTIMATE.start_main_~data~0#1|) (= .cse2 .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse7) 0))))))) is different from true [2023-02-15 19:50:41,380 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse5 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse3 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse3)) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_30| .cse4))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse5 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse6 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= (select (select |c_#memory_int| .cse3) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse7))))))))) is different from false [2023-02-15 19:50:41,384 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse5 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse3 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse3)) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_30| .cse4))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse5 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse6 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= (select (select |c_#memory_int| .cse3) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse7))))))))) is different from true [2023-02-15 19:50:41,474 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse3 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| .cse3) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2023-02-15 19:50:41,478 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse3 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| .cse3) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2023-02-15 19:50:41,577 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse5 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse3 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse3)) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_30| .cse4))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse5 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse6 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= (select (select |c_#memory_int| .cse3) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse6))))))))) is different from false [2023-02-15 19:50:41,581 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse5 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse3 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse3)) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_30| .cse4))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse5 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse6 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= (select (select |c_#memory_int| .cse3) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse6))))))))) is different from true [2023-02-15 19:50:41,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:41,603 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2023-02-15 19:50:41,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 339 treesize of output 130 [2023-02-15 19:50:41,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:41,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:41,616 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:50:41,616 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 30 [2023-02-15 19:50:41,636 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimIndex_62 Int) (v_arrayElimIndex_61 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_61) 0) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~temp~2#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_62) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_61) 1) (= |c_ULTIMATE.start_main_#t~mem15#1| (select (select |c_#memory_int| v_arrayElimIndex_62) 0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:50:41,638 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimIndex_62 Int) (v_arrayElimIndex_61 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_61) 0) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~temp~2#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_62) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_61) 1) (= |c_ULTIMATE.start_main_#t~mem15#1| (select (select |c_#memory_int| v_arrayElimIndex_62) 0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|)) is different from true [2023-02-15 19:50:41,657 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimIndex_62 Int) (v_arrayElimIndex_61 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_61) 0) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_62) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_61) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| v_arrayElimIndex_62) 0))))) is different from false [2023-02-15 19:50:41,659 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimIndex_62 Int) (v_arrayElimIndex_61 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_61) 0) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_62) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_61) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| v_arrayElimIndex_62) 0))))) is different from true [2023-02-15 19:50:41,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:41,666 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 22 treesize of output 10 [2023-02-15 19:50:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2023-02-15 19:50:41,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:50:42,514 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:50:42,514 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 1880 treesize of output 1872 [2023-02-15 19:50:42,598 INFO L321 Elim1Store]: treesize reduction 4, result has 99.9 percent of original size [2023-02-15 19:50:42,598 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 4636 treesize of output 6449 [2023-02-15 19:50:42,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:50:42,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2164 treesize of output 2168 [2023-02-15 19:50:46,296 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse284 (not (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|))) (.cse0 (= |c_ULTIMATE.start_sll_append_~data#1| |c_ULTIMATE.start_main_~data~0#1|))) (and (or .cse0 (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse11 (select (select .cse8 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse12 (+ (select (select .cse10 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse9 (select (select .cse8 .cse11) .cse12))) (let ((.cse6 (select .cse10 .cse9)) (.cse7 (+ (select (select .cse10 .cse11) .cse12) 4))) (let ((.cse2 (store .cse10 .cse9 (store .cse6 .cse7 0))) (.cse3 (store .cse8 .cse9 (store (select .cse8 .cse9) .cse7 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse2 .cse4) .cse5))) (or (= .cse1 0) (= .cse1 (select (select .cse2 (select (select .cse3 .cse4) .cse5)) (+ .cse1 4))) (not (= 0 (select .cse6 .cse7))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse23 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse25 (select (select .cse23 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse26 (+ (select (select .cse24 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse20 (select (select .cse23 .cse25) .cse26))) (let ((.cse13 (select .cse24 .cse20)) (.cse14 (+ (select (select .cse24 .cse25) .cse26) 4))) (let ((.cse15 (store .cse24 .cse20 (store .cse13 .cse14 0))) (.cse19 (store .cse23 .cse20 (store (select .cse23 .cse20) .cse14 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse21 (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse22 (+ (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse18 (select (select .cse15 .cse21) .cse22))) (let ((.cse17 (+ .cse18 4)) (.cse16 (select (select .cse19 .cse21) .cse22))) (or (not (= 0 (select .cse13 .cse14))) (= (select (select .cse15 .cse16) .cse17) .cse18) (= (select (select .cse19 .cse16) .cse17) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (not (= .cse16 .cse20)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (or .cse0 (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse37 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse36 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse38 (select (select .cse36 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse39 (+ (select (select .cse37 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse34 (select (select .cse36 .cse38) .cse39))) (let ((.cse32 (select .cse37 .cse34)) (.cse33 (+ (select (select .cse37 .cse38) .cse39) 4))) (let ((.cse28 (store .cse37 .cse34 (store .cse32 .cse33 0))) (.cse35 (store .cse36 .cse34 (store (select .cse36 .cse34) .cse33 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse30 (select (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse31 (+ (select (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse29 (select (select .cse35 .cse30) .cse31))) (or (let ((.cse27 (select (select .cse28 .cse30) .cse31))) (= .cse27 (select (select .cse28 .cse29) (+ .cse27 4)))) (not (= 0 (select .cse32 .cse33))) (not (= .cse29 .cse34)) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse51 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse50 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse52 (select (select .cse50 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse53 (+ (select (select .cse51 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse43 (select (select .cse50 .cse52) .cse53))) (let ((.cse44 (select .cse51 .cse43)) (.cse45 (+ (select (select .cse51 .cse52) .cse53) 4))) (let ((.cse46 (store .cse51 .cse43 (store .cse44 .cse45 0))) (.cse40 (store .cse50 .cse43 (store (select .cse50 .cse43) .cse45 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse48 (select (select .cse40 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse49 (+ (select (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse47 (select (select .cse46 .cse48) .cse49))) (let ((.cse42 (+ .cse47 4)) (.cse41 (select (select .cse40 .cse48) .cse49))) (or (not (= (select (select .cse40 .cse41) .cse42) .cse43)) (not (= 0 (select .cse44 .cse45))) (= (select (select .cse46 .cse41) .cse42) .cse47) (not (= .cse41 .cse43)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse65 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse64 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse66 (select (select .cse64 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse67 (+ (select (select .cse65 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse59 (select (select .cse64 .cse66) .cse67))) (let ((.cse54 (select .cse65 .cse59)) (.cse55 (+ (select (select .cse65 .cse66) .cse67) 4))) (let ((.cse60 (store .cse65 .cse59 (store .cse54 .cse55 0))) (.cse63 (store .cse64 .cse59 (store (select .cse64 .cse59) .cse55 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse61 (select (select .cse63 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse62 (+ (select (select .cse60 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse58 (select (select .cse63 .cse61) .cse62)) (.cse57 (select (select .cse60 .cse61) .cse62))) (let ((.cse56 (select (select .cse60 .cse58) (+ .cse57 4)))) (or (not (= 0 (select .cse54 .cse55))) (= .cse56 .cse57) (= .cse56 0) (not (= .cse58 .cse59)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse79 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse77 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse80 (select (select .cse77 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse81 (+ (select (select .cse79 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse78 (select (select .cse77 .cse80) .cse81))) (let ((.cse69 (select .cse79 .cse78)) (.cse70 (+ (select (select .cse79 .cse80) .cse81) 4))) (let ((.cse71 (store .cse79 .cse78 (store .cse69 .cse70 0))) (.cse74 (store .cse77 .cse78 (store (select .cse77 .cse78) .cse70 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse75 (select (select .cse74 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse76 (+ (select (select .cse71 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse68 (select (select .cse71 .cse75) .cse76))) (let ((.cse72 (select (select .cse74 .cse75) .cse76)) (.cse73 (+ .cse68 4))) (or (= .cse68 0) (not (= 0 (select .cse69 .cse70))) (= (select (select .cse71 .cse72) .cse73) .cse68) (= (select (select .cse74 .cse72) .cse73) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse93 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse91 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse94 (select (select .cse91 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse95 (+ (select (select .cse93 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse92 (select (select .cse91 .cse94) .cse95))) (let ((.cse86 (select .cse93 .cse92)) (.cse87 (+ (select (select .cse93 .cse94) .cse95) 4))) (let ((.cse83 (store .cse93 .cse92 (store .cse86 .cse87 0))) (.cse88 (store .cse91 .cse92 (store (select .cse91 .cse92) .cse87 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse89 (select (select .cse88 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse90 (+ (select (select .cse83 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse82 (select (select .cse83 .cse89) .cse90))) (let ((.cse84 (select (select .cse88 .cse89) .cse90)) (.cse85 (+ .cse82 4))) (or (= .cse82 0) (= .cse82 (select (select .cse83 .cse84) .cse85)) (not (= 0 (select .cse86 .cse87))) (= (select (select .cse88 .cse84) .cse85) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse106 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse105 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse107 (select (select .cse105 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse108 (+ (select (select .cse106 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse100 (select (select .cse105 .cse107) .cse108))) (let ((.cse96 (select .cse106 .cse100)) (.cse97 (+ (select (select .cse106 .cse107) .cse108) 4))) (let ((.cse102 (store .cse106 .cse100 (store .cse96 .cse97 0))) (.cse101 (store .cse105 .cse100 (store (select .cse105 .cse100) .cse97 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse103 (select (select .cse101 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse104 (+ (select (select .cse102 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse99 (select (select .cse101 .cse103) .cse104))) (let ((.cse98 (select (select .cse101 .cse99) (+ (select (select .cse102 .cse103) .cse104) 4)))) (or (not (= 0 (select .cse96 .cse97))) (= .cse98 .cse99) (= .cse98 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (not (= .cse99 .cse100)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse120 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse119 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse121 (select (select .cse119 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse122 (+ (select (select .cse120 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse112 (select (select .cse119 .cse121) .cse122))) (let ((.cse115 (select .cse120 .cse112)) (.cse116 (+ (select (select .cse120 .cse121) .cse122) 4))) (let ((.cse114 (store .cse120 .cse112 (store .cse115 .cse116 0))) (.cse109 (store .cse119 .cse112 (store (select .cse119 .cse112) .cse116 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse117 (select (select .cse109 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse118 (+ (select (select .cse114 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse113 (select (select .cse114 .cse117) .cse118))) (let ((.cse111 (+ .cse113 4)) (.cse110 (select (select .cse109 .cse117) .cse118))) (or (not (= (select (select .cse109 .cse110) .cse111) .cse112)) (= .cse113 (select (select .cse114 .cse110) .cse111)) (not (= 0 (select .cse115 .cse116))) (not (= .cse110 .cse112)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse134 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse133 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse135 (select (select .cse133 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse136 (+ (select (select .cse134 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse126 (select (select .cse133 .cse135) .cse136))) (let ((.cse129 (select .cse134 .cse126)) (.cse130 (+ (select (select .cse134 .cse135) .cse136) 4))) (let ((.cse128 (store .cse134 .cse126 (store .cse129 .cse130 0))) (.cse123 (store .cse133 .cse126 (store (select .cse133 .cse126) .cse130 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse131 (select (select .cse123 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse132 (+ (select (select .cse128 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse127 (select (select .cse128 .cse131) .cse132))) (let ((.cse125 (+ .cse127 4)) (.cse124 (select (select .cse123 .cse131) .cse132))) (or (not (= (select (select .cse123 .cse124) .cse125) .cse126)) (= .cse127 (select (select .cse128 .cse124) .cse125)) (not (= 0 (select .cse129 .cse130))) (= .cse124 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (or .cse0 (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse147 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse145 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse148 (select (select .cse145 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse149 (+ (select (select .cse147 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse146 (select (select .cse145 .cse148) .cse149))) (let ((.cse142 (select .cse147 .cse146)) (.cse143 (+ (select (select .cse147 .cse148) .cse149) 4))) (let ((.cse138 (store .cse147 .cse146 (store .cse142 .cse143 0))) (.cse144 (store .cse145 .cse146 (store (select .cse145 .cse146) .cse143 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse140 (select (select .cse144 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse141 (+ (select (select .cse138 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse139 (select (select .cse144 .cse140) .cse141))) (or (let ((.cse137 (select (select .cse138 .cse140) .cse141))) (= .cse137 (select (select .cse138 .cse139) (+ .cse137 4)))) (not (= 0 (select .cse142 .cse143))) (= .cse139 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse160 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse158 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse161 (select (select .cse158 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse162 (+ (select (select .cse160 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse159 (select (select .cse158 .cse161) .cse162))) (let ((.cse150 (select .cse160 .cse159)) (.cse151 (+ (select (select .cse160 .cse161) .cse162) 4))) (let ((.cse155 (store .cse160 .cse159 (store .cse150 .cse151 0))) (.cse152 (store .cse158 .cse159 (store (select .cse158 .cse159) .cse151 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse156 (select (select .cse152 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse157 (+ (select (select .cse155 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse154 (+ (select (select .cse155 .cse156) .cse157) 4)) (.cse153 (select (select .cse152 .cse156) .cse157))) (or (not (= 0 (select .cse150 .cse151))) (= (select (select .cse152 .cse153) .cse154) .cse153) (= (select (select .cse155 .cse153) .cse154) 0) (= .cse153 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse174 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse173 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse175 (select (select .cse173 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse176 (+ (select (select .cse174 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse166 (select (select .cse173 .cse175) .cse176))) (let ((.cse169 (select .cse174 .cse166)) (.cse170 (+ (select (select .cse174 .cse175) .cse176) 4))) (let ((.cse168 (store .cse174 .cse166 (store .cse169 .cse170 0))) (.cse163 (store .cse173 .cse166 (store (select .cse173 .cse166) .cse170 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse171 (select (select .cse163 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse172 (+ (select (select .cse168 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse167 (select (select .cse168 .cse171) .cse172))) (let ((.cse164 (select (select .cse163 .cse171) .cse172)) (.cse165 (+ .cse167 4))) (or (not (= (select (select .cse163 .cse164) .cse165) .cse166)) (= .cse167 0) (= .cse167 (select (select .cse168 .cse164) .cse165)) (not (= 0 (select .cse169 .cse170))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse188 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse186 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse189 (select (select .cse186 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse190 (+ (select (select .cse188 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse187 (select (select .cse186 .cse189) .cse190))) (let ((.cse178 (select .cse188 .cse187)) (.cse179 (+ (select (select .cse188 .cse189) .cse190) 4))) (let ((.cse183 (store .cse188 .cse187 (store .cse178 .cse179 0))) (.cse182 (store .cse186 .cse187 (store (select .cse186 .cse187) .cse179 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse184 (select (select .cse182 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse185 (+ (select (select .cse183 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse181 (select (select .cse182 .cse184) .cse185)) (.cse177 (select (select .cse183 .cse184) .cse185))) (let ((.cse180 (select (select .cse182 .cse181) (+ .cse177 4)))) (or (= .cse177 0) (not (= 0 (select .cse178 .cse179))) (= .cse180 .cse181) (= .cse180 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse201 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse200 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse202 (select (select .cse200 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse203 (+ (select (select .cse201 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse197 (select (select .cse200 .cse202) .cse203))) (let ((.cse191 (select .cse201 .cse197)) (.cse192 (+ (select (select .cse201 .cse202) .cse203) 4))) (let ((.cse196 (store .cse201 .cse197 (store .cse191 .cse192 0))) (.cse193 (store .cse200 .cse197 (store (select .cse200 .cse197) .cse192 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse198 (select (select .cse193 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse199 (+ (select (select .cse196 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse195 (+ (select (select .cse196 .cse198) .cse199) 4)) (.cse194 (select (select .cse193 .cse198) .cse199))) (or (not (= 0 (select .cse191 .cse192))) (= (select (select .cse193 .cse194) .cse195) .cse194) (= (select (select .cse196 .cse194) .cse195) 0) (not (= .cse194 .cse197))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (or (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse215 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse213 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse216 (select (select .cse213 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse217 (+ (select (select .cse215 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse214 (select (select .cse213 .cse216) .cse217))) (let ((.cse204 (select .cse215 .cse214)) (.cse205 (+ (select (select .cse215 .cse216) .cse217) 4))) (let ((.cse206 (store .cse215 .cse214 (store .cse204 .cse205 0))) (.cse210 (store .cse213 .cse214 (store (select .cse213 .cse214) .cse205 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse211 (select (select .cse210 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse212 (+ (select (select .cse206 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse209 (select (select .cse206 .cse211) .cse212))) (let ((.cse207 (select (select .cse210 .cse211) .cse212)) (.cse208 (+ .cse209 4))) (or (not (= 0 (select .cse204 .cse205))) (= (select (select .cse206 .cse207) .cse208) .cse209) (= (select (select .cse210 .cse207) .cse208) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse228 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse227 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse229 (select (select .cse227 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse230 (+ (select (select .cse228 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse219 (select (select .cse227 .cse229) .cse230))) (let ((.cse220 (select .cse228 .cse219)) (.cse221 (+ (select (select .cse228 .cse229) .cse230) 4))) (let ((.cse224 (store .cse228 .cse219 (store .cse220 .cse221 0))) (.cse223 (store .cse227 .cse219 (store (select .cse227 .cse219) .cse221 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse225 (select (select .cse223 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse226 (+ (select (select .cse224 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse222 (select (select .cse223 .cse225) .cse226))) (let ((.cse218 (select (select .cse223 .cse222) (+ (select (select .cse224 .cse225) .cse226) 4)))) (or (not (= .cse218 .cse219)) (not (= 0 (select .cse220 .cse221))) (= .cse218 .cse222))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse241 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse239 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse242 (select (select .cse239 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse243 (+ (select (select .cse241 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse240 (select (select .cse239 .cse242) .cse243))) (let ((.cse231 (select .cse241 .cse240)) (.cse232 (+ (select (select .cse241 .cse242) .cse243) 4))) (let ((.cse236 (store .cse241 .cse240 (store .cse231 .cse232 0))) (.cse235 (store .cse239 .cse240 (store (select .cse239 .cse240) .cse232 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse237 (select (select .cse235 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse238 (+ (select (select .cse236 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse234 (select (select .cse235 .cse237) .cse238))) (let ((.cse233 (select (select .cse235 .cse234) (+ (select (select .cse236 .cse237) .cse238) 4)))) (or (not (= 0 (select .cse231 .cse232))) (= .cse233 .cse234) (= .cse233 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse255 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse254 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse256 (select (select .cse254 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse257 (+ (select (select .cse255 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse247 (select (select .cse254 .cse256) .cse257))) (let ((.cse248 (select .cse255 .cse247)) (.cse249 (+ (select (select .cse255 .cse256) .cse257) 4))) (let ((.cse250 (store .cse255 .cse247 (store .cse248 .cse249 0))) (.cse244 (store .cse254 .cse247 (store (select .cse254 .cse247) .cse249 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse252 (select (select .cse244 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse253 (+ (select (select .cse250 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse251 (select (select .cse250 .cse252) .cse253))) (let ((.cse245 (select (select .cse244 .cse252) .cse253)) (.cse246 (+ .cse251 4))) (or (not (= (select (select .cse244 .cse245) .cse246) .cse247)) (not (= 0 (select .cse248 .cse249))) (= (select (select .cse250 .cse245) .cse246) .cse251))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse268 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse266 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse269 (select (select .cse266 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse270 (+ (select (select .cse268 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse267 (select (select .cse266 .cse269) .cse270))) (let ((.cse258 (select .cse268 .cse267)) (.cse259 (+ (select (select .cse268 .cse269) .cse270) 4))) (let ((.cse262 (store .cse268 .cse267 (store .cse258 .cse259 0))) (.cse263 (store .cse266 .cse267 (store (select .cse266 .cse267) .cse259 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse264 (select (select .cse263 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse265 (+ (select (select .cse262 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse261 (select (select .cse262 .cse264) .cse265))) (let ((.cse260 (select (select .cse262 (select (select .cse263 .cse264) .cse265)) (+ .cse261 4)))) (or (not (= 0 (select .cse258 .cse259))) (= .cse260 .cse261) (= .cse260 0))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse281 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse279 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse282 (select (select .cse279 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse283 (+ (select (select .cse281 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse280 (select (select .cse279 .cse282) .cse283))) (let ((.cse271 (select .cse281 .cse280)) (.cse272 (+ (select (select .cse281 .cse282) .cse283) 4))) (let ((.cse276 (store .cse281 .cse280 (store .cse271 .cse272 0))) (.cse273 (store .cse279 .cse280 (store (select .cse279 .cse280) .cse272 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse277 (select (select .cse273 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse278 (+ (select (select .cse276 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse274 (select (select .cse273 .cse277) .cse278)) (.cse275 (+ (select (select .cse276 .cse277) .cse278) 4))) (or (not (= 0 (select .cse271 .cse272))) (= (select (select .cse273 .cse274) .cse275) .cse274) (= (select (select .cse276 .cse274) .cse275) 0)))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))) .cse284) (or (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse295 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse293 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse296 (select (select .cse293 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse297 (+ (select (select .cse295 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse294 (select (select .cse293 .cse296) .cse297))) (let ((.cse287 (select .cse295 .cse294)) (.cse288 (+ (select (select .cse295 .cse296) .cse297) 4))) (let ((.cse289 (store .cse295 .cse294 (store .cse287 .cse288 0))) (.cse290 (store .cse293 .cse294 (store (select .cse293 .cse294) .cse288 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse291 (select (select .cse290 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse292 (+ (select (select .cse289 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse285 (select (select .cse289 .cse291) .cse292))) (let ((.cse286 (select (select .cse289 (select (select .cse290 .cse291) .cse292)) (+ .cse285 4)))) (or (= .cse285 .cse286) (not (= 0 (select .cse287 .cse288))) (= .cse286 0))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse309 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse307 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse310 (select (select .cse307 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse311 (+ (select (select .cse309 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse308 (select (select .cse307 .cse310) .cse311))) (let ((.cse302 (select .cse309 .cse308)) (.cse303 (+ (select (select .cse309 .cse310) .cse311) 4))) (let ((.cse299 (store .cse309 .cse308 (store .cse302 .cse303 0))) (.cse304 (store .cse307 .cse308 (store (select .cse307 .cse308) .cse303 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse305 (select (select .cse304 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse306 (+ (select (select .cse299 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse298 (select (select .cse299 .cse305) .cse306))) (let ((.cse300 (select (select .cse304 .cse305) .cse306)) (.cse301 (+ .cse298 4))) (or (= .cse298 (select (select .cse299 .cse300) .cse301)) (not (= 0 (select .cse302 .cse303))) (= (select (select .cse304 .cse300) .cse301) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse323 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse322 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse324 (select (select .cse322 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse325 (+ (select (select .cse323 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse315 (select (select .cse322 .cse324) .cse325))) (let ((.cse318 (select .cse323 .cse315)) (.cse319 (+ (select (select .cse323 .cse324) .cse325) 4))) (let ((.cse317 (store .cse323 .cse315 (store .cse318 .cse319 0))) (.cse312 (store .cse322 .cse315 (store (select .cse322 .cse315) .cse319 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse320 (select (select .cse312 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse321 (+ (select (select .cse317 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse316 (select (select .cse317 .cse320) .cse321))) (let ((.cse313 (select (select .cse312 .cse320) .cse321)) (.cse314 (+ .cse316 4))) (or (not (= (select (select .cse312 .cse313) .cse314) .cse315)) (= .cse316 (select (select .cse317 .cse313) .cse314)) (not (= 0 (select .cse318 .cse319))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))) .cse284) (or .cse0 (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse335 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse333 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse336 (select (select .cse333 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse337 (+ (select (select .cse335 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse334 (select (select .cse333 .cse336) .cse337))) (let ((.cse326 (select .cse335 .cse334)) (.cse327 (+ (select (select .cse335 .cse336) .cse337) 4))) (let ((.cse330 (store .cse335 .cse334 (store .cse326 .cse327 0))) (.cse328 (store .cse333 .cse334 (store (select .cse333 .cse334) .cse327 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse331 (select (select .cse328 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse332 (+ (select (select .cse330 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse329 (select (select .cse328 .cse331) .cse332))) (or (not (= 0 (select .cse326 .cse327))) (= (select (select .cse328 .cse329) (+ (select (select .cse330 .cse331) .cse332) 4)) .cse329) (= .cse329 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse348 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse346 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse349 (select (select .cse346 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse350 (+ (select (select .cse348 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse347 (select (select .cse346 .cse349) .cse350))) (let ((.cse338 (select .cse348 .cse347)) (.cse339 (+ (select (select .cse348 .cse349) .cse350) 4))) (let ((.cse340 (store .cse348 .cse347 (store .cse338 .cse339 0))) (.cse345 (store .cse346 .cse347 (store (select .cse346 .cse347) .cse339 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse343 (select (select .cse345 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse344 (+ (select (select .cse340 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse341 (select (select .cse345 .cse343) .cse344))) (or (not (= 0 (select .cse338 .cse339))) (let ((.cse342 (select (select .cse340 .cse343) .cse344))) (= (select (select .cse340 .cse341) (+ .cse342 4)) .cse342)) (= .cse341 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse362 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse361 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse363 (select (select .cse361 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse364 (+ (select (select .cse362 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse354 (select (select .cse361 .cse363) .cse364))) (let ((.cse355 (select .cse362 .cse354)) (.cse356 (+ (select (select .cse362 .cse363) .cse364) 4))) (let ((.cse357 (store .cse362 .cse354 (store .cse355 .cse356 0))) (.cse351 (store .cse361 .cse354 (store (select .cse361 .cse354) .cse356 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse359 (select (select .cse351 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse360 (+ (select (select .cse357 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse358 (select (select .cse357 .cse359) .cse360))) (let ((.cse353 (+ .cse358 4)) (.cse352 (select (select .cse351 .cse359) .cse360))) (or (not (= (select (select .cse351 .cse352) .cse353) .cse354)) (not (= 0 (select .cse355 .cse356))) (= (select (select .cse357 .cse352) .cse353) .cse358) (= .cse352 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse375 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse373 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse376 (select (select .cse373 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse377 (+ (select (select .cse375 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse374 (select (select .cse373 .cse376) .cse377))) (let ((.cse366 (select .cse375 .cse374)) (.cse367 (+ (select (select .cse375 .cse376) .cse377) 4))) (let ((.cse369 (store .cse375 .cse374 (store .cse366 .cse367 0))) (.cse370 (store .cse373 .cse374 (store (select .cse373 .cse374) .cse367 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse371 (select (select .cse370 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse372 (+ (select (select .cse369 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse365 (select (select .cse369 .cse371) .cse372))) (let ((.cse368 (select (select .cse369 (select (select .cse370 .cse371) .cse372)) (+ .cse365 4)))) (or (= .cse365 0) (not (= 0 (select .cse366 .cse367))) (= .cse368 .cse365) (= .cse368 0))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse388 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse387 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse389 (select (select .cse387 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse390 (+ (select (select .cse388 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse379 (select (select .cse387 .cse389) .cse390))) (let ((.cse380 (select .cse388 .cse379)) (.cse381 (+ (select (select .cse388 .cse389) .cse390) 4))) (let ((.cse384 (store .cse388 .cse379 (store .cse380 .cse381 0))) (.cse383 (store .cse387 .cse379 (store (select .cse387 .cse379) .cse381 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse385 (select (select .cse383 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse386 (+ (select (select .cse384 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse382 (select (select .cse383 .cse385) .cse386))) (let ((.cse378 (select (select .cse383 .cse382) (+ (select (select .cse384 .cse385) .cse386) 4)))) (or (not (= .cse378 .cse379)) (not (= 0 (select .cse380 .cse381))) (= .cse378 .cse382) (= .cse382 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse402 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse400 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse403 (select (select .cse400 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse404 (+ (select (select .cse402 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse401 (select (select .cse400 .cse403) .cse404))) (let ((.cse395 (select .cse402 .cse401)) (.cse396 (+ (select (select .cse402 .cse403) .cse404) 4))) (let ((.cse392 (store .cse402 .cse401 (store .cse395 .cse396 0))) (.cse397 (store .cse400 .cse401 (store (select .cse400 .cse401) .cse396 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse398 (select (select .cse397 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse399 (+ (select (select .cse392 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse391 (select (select .cse392 .cse398) .cse399))) (let ((.cse394 (+ .cse391 4)) (.cse393 (select (select .cse397 .cse398) .cse399))) (or (= .cse391 (select (select .cse392 .cse393) .cse394)) (not (= 0 (select .cse395 .cse396))) (= (select (select .cse397 .cse393) .cse394) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (= .cse393 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (or (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse414 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse412 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse415 (select (select .cse412 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse416 (+ (select (select .cse414 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse413 (select (select .cse412 .cse415) .cse416))) (let ((.cse406 (select .cse414 .cse413)) (.cse407 (+ (select (select .cse414 .cse415) .cse416) 4))) (let ((.cse408 (store .cse414 .cse413 (store .cse406 .cse407 0))) (.cse409 (store .cse412 .cse413 (store (select .cse412 .cse413) .cse407 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse410 (select (select .cse409 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse411 (+ (select (select .cse408 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse405 (select (select .cse408 .cse410) .cse411))) (or (= .cse405 0) (not (= 0 (select .cse406 .cse407))) (= (select (select .cse408 (select (select .cse409 .cse410) .cse411)) (+ .cse405 4)) .cse405)))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse427 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse425 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse428 (select (select .cse425 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse429 (+ (select (select .cse427 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse426 (select (select .cse425 .cse428) .cse429))) (let ((.cse418 (select .cse427 .cse426)) (.cse419 (+ (select (select .cse427 .cse428) .cse429) 4))) (let ((.cse424 (store .cse427 .cse426 (store .cse418 .cse419 0))) (.cse420 (store .cse425 .cse426 (store (select .cse425 .cse426) .cse419 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse422 (select (select .cse420 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse423 (+ (select (select .cse424 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse417 (select (select .cse424 .cse422) .cse423))) (or (= .cse417 0) (not (= 0 (select .cse418 .cse419))) (let ((.cse421 (select (select .cse420 .cse422) .cse423))) (= (select (select .cse420 .cse421) (+ .cse417 4)) .cse421))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))) .cse0) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse441 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse439 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse442 (select (select .cse439 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse443 (+ (select (select .cse441 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse440 (select (select .cse439 .cse442) .cse443))) (let ((.cse431 (select .cse441 .cse440)) (.cse432 (+ (select (select .cse441 .cse442) .cse443) 4))) (let ((.cse436 (store .cse441 .cse440 (store .cse431 .cse432 0))) (.cse433 (store .cse439 .cse440 (store (select .cse439 .cse440) .cse432 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse437 (select (select .cse433 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse438 (+ (select (select .cse436 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse430 (select (select .cse436 .cse437) .cse438))) (let ((.cse434 (select (select .cse433 .cse437) .cse438)) (.cse435 (+ .cse430 4))) (or (= .cse430 0) (not (= 0 (select .cse431 .cse432))) (= (select (select .cse433 .cse434) .cse435) .cse434) (= (select (select .cse436 .cse434) .cse435) 0))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse455 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse454 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse456 (select (select .cse454 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse457 (+ (select (select .cse455 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse451 (select (select .cse454 .cse456) .cse457))) (let ((.cse448 (select .cse455 .cse451)) (.cse449 (+ (select (select .cse455 .cse456) .cse457) 4))) (let ((.cse445 (store .cse455 .cse451 (store .cse448 .cse449 0))) (.cse450 (store .cse454 .cse451 (store (select .cse454 .cse451) .cse449 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse452 (select (select .cse450 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse453 (+ (select (select .cse445 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse444 (select (select .cse445 .cse452) .cse453))) (let ((.cse447 (+ .cse444 4)) (.cse446 (select (select .cse450 .cse452) .cse453))) (or (= .cse444 (select (select .cse445 .cse446) .cse447)) (not (= 0 (select .cse448 .cse449))) (= (select (select .cse450 .cse446) .cse447) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (not (= .cse446 .cse451)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse468 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse467 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse469 (select (select .cse467 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse470 (+ (select (select .cse468 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse465 (select (select .cse467 .cse469) .cse470))) (let ((.cse458 (select .cse468 .cse465)) (.cse459 (+ (select (select .cse468 .cse469) .cse470) 4))) (let ((.cse460 (store .cse468 .cse465 (store .cse458 .cse459 0))) (.cse466 (store .cse467 .cse465 (store (select .cse467 .cse465) .cse459 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse463 (select (select .cse466 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse464 (+ (select (select .cse460 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse461 (select (select .cse466 .cse463) .cse464))) (or (not (= 0 (select .cse458 .cse459))) (let ((.cse462 (select (select .cse460 .cse463) .cse464))) (= (select (select .cse460 .cse461) (+ .cse462 4)) .cse462)) (not (= .cse461 .cse465))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse480 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse479 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse481 (select (select .cse479 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse482 (+ (select (select .cse480 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse478 (select (select .cse479 .cse481) .cse482))) (let ((.cse471 (select .cse480 .cse478)) (.cse472 (+ (select (select .cse480 .cse481) .cse482) 4))) (let ((.cse475 (store .cse480 .cse478 (store .cse471 .cse472 0))) (.cse473 (store .cse479 .cse478 (store (select .cse479 .cse478) .cse472 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse476 (select (select .cse473 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse477 (+ (select (select .cse475 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse474 (select (select .cse473 .cse476) .cse477))) (or (not (= 0 (select .cse471 .cse472))) (= (select (select .cse473 .cse474) (+ (select (select .cse475 .cse476) .cse477) 4)) .cse474) (not (= .cse474 .cse478))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse494 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse493 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse495 (select (select .cse493 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse496 (+ (select (select .cse494 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse484 (select (select .cse493 .cse495) .cse496))) (let ((.cse486 (select .cse494 .cse484)) (.cse487 (+ (select (select .cse494 .cse495) .cse496) 4))) (let ((.cse490 (store .cse494 .cse484 (store .cse486 .cse487 0))) (.cse489 (store .cse493 .cse484 (store (select .cse493 .cse484) .cse487 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse491 (select (select .cse489 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse492 (+ (select (select .cse490 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse488 (select (select .cse489 .cse491) .cse492)) (.cse485 (select (select .cse490 .cse491) .cse492))) (let ((.cse483 (select (select .cse489 .cse488) (+ .cse485 4)))) (or (not (= .cse483 .cse484)) (= .cse485 0) (not (= 0 (select .cse486 .cse487))) (= .cse483 .cse488))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse508 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse506 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse509 (select (select .cse506 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse510 (+ (select (select .cse508 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse507 (select (select .cse506 .cse509) .cse510))) (let ((.cse499 (select .cse508 .cse507)) (.cse500 (+ (select (select .cse508 .cse509) .cse510) 4))) (let ((.cse502 (store .cse508 .cse507 (store .cse499 .cse500 0))) (.cse505 (store .cse506 .cse507 (store (select .cse506 .cse507) .cse500 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse503 (select (select .cse505 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse504 (+ (select (select .cse502 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse501 (select (select .cse505 .cse503) .cse504)) (.cse497 (select (select .cse502 .cse503) .cse504))) (let ((.cse498 (select (select .cse502 .cse501) (+ .cse497 4)))) (or (= .cse497 .cse498) (not (= 0 (select .cse499 .cse500))) (= .cse498 0) (= .cse501 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse522 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse520 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse523 (select (select .cse520 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse524 (+ (select (select .cse522 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse521 (select (select .cse520 .cse523) .cse524))) (let ((.cse511 (select .cse522 .cse521)) (.cse512 (+ (select (select .cse522 .cse523) .cse524) 4))) (let ((.cse516 (store .cse522 .cse521 (store .cse511 .cse512 0))) (.cse519 (store .cse520 .cse521 (store (select .cse520 .cse521) .cse512 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse517 (select (select .cse519 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse518 (+ (select (select .cse516 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse515 (select (select .cse519 .cse517) .cse518)) (.cse514 (select (select .cse516 .cse517) .cse518))) (let ((.cse513 (select (select .cse516 .cse515) (+ .cse514 4)))) (or (not (= 0 (select .cse511 .cse512))) (= .cse513 .cse514) (= .cse513 0) (= .cse515 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse536 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse534 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse537 (select (select .cse534 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse538 (+ (select (select .cse536 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse535 (select (select .cse534 .cse537) .cse538))) (let ((.cse525 (select .cse536 .cse535)) (.cse526 (+ (select (select .cse536 .cse537) .cse538) 4))) (let ((.cse527 (store .cse536 .cse535 (store .cse525 .cse526 0))) (.cse531 (store .cse534 .cse535 (store (select .cse534 .cse535) .cse526 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse532 (select (select .cse531 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse533 (+ (select (select .cse527 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse530 (select (select .cse527 .cse532) .cse533))) (let ((.cse529 (+ .cse530 4)) (.cse528 (select (select .cse531 .cse532) .cse533))) (or (not (= 0 (select .cse525 .cse526))) (= (select (select .cse527 .cse528) .cse529) .cse530) (= (select (select .cse531 .cse528) .cse529) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (= .cse528 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse550 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse549 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse551 (select (select .cse549 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse552 (+ (select (select .cse550 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse544 (select (select .cse549 .cse551) .cse552))) (let ((.cse541 (select .cse550 .cse544)) (.cse542 (+ (select (select .cse550 .cse551) .cse552) 4))) (let ((.cse545 (store .cse550 .cse544 (store .cse541 .cse542 0))) (.cse548 (store .cse549 .cse544 (store (select .cse549 .cse544) .cse542 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse546 (select (select .cse548 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse547 (+ (select (select .cse545 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse543 (select (select .cse548 .cse546) .cse547)) (.cse539 (select (select .cse545 .cse546) .cse547))) (let ((.cse540 (select (select .cse545 .cse543) (+ .cse539 4)))) (or (= .cse539 .cse540) (not (= 0 (select .cse541 .cse542))) (= .cse540 0) (not (= .cse543 .cse544)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse564 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse563 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse565 (select (select .cse563 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse566 (+ (select (select .cse564 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse556 (select (select .cse563 .cse565) .cse566))) (let ((.cse558 (select .cse564 .cse556)) (.cse559 (+ (select (select .cse564 .cse565) .cse566) 4))) (let ((.cse560 (store .cse564 .cse556 (store .cse558 .cse559 0))) (.cse553 (store .cse563 .cse556 (store (select .cse563 .cse556) .cse559 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse561 (select (select .cse553 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse562 (+ (select (select .cse560 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse557 (select (select .cse560 .cse561) .cse562))) (let ((.cse554 (select (select .cse553 .cse561) .cse562)) (.cse555 (+ .cse557 4))) (or (not (= (select (select .cse553 .cse554) .cse555) .cse556)) (= .cse557 0) (not (= 0 (select .cse558 .cse559))) (= (select (select .cse560 .cse554) .cse555) .cse557))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse577 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse575 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse578 (select (select .cse575 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse579 (+ (select (select .cse577 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse576 (select (select .cse575 .cse578) .cse579))) (let ((.cse569 (select .cse577 .cse576)) (.cse570 (+ (select (select .cse577 .cse578) .cse579) 4))) (let ((.cse571 (store .cse577 .cse576 (store .cse569 .cse570 0))) (.cse572 (store .cse575 .cse576 (store (select .cse575 .cse576) .cse570 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse573 (select (select .cse572 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse574 (+ (select (select .cse571 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse567 (select (select .cse571 .cse573) .cse574))) (let ((.cse568 (select (select .cse571 (select (select .cse572 .cse573) .cse574)) (+ .cse567 4)))) (or (= .cse567 0) (= .cse567 .cse568) (not (= 0 (select .cse569 .cse570))) (= .cse568 0))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse590 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse588 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse591 (select (select .cse588 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse592 (+ (select (select .cse590 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse589 (select (select .cse588 .cse591) .cse592))) (let ((.cse580 (select .cse590 .cse589)) (.cse581 (+ (select (select .cse590 .cse591) .cse592) 4))) (let ((.cse585 (store .cse590 .cse589 (store .cse580 .cse581 0))) (.cse584 (store .cse588 .cse589 (store (select .cse588 .cse589) .cse581 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse586 (select (select .cse584 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse587 (+ (select (select .cse585 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse583 (select (select .cse584 .cse586) .cse587))) (let ((.cse582 (select (select .cse584 .cse583) (+ (select (select .cse585 .cse586) .cse587) 4)))) (or (not (= 0 (select .cse580 .cse581))) (= .cse582 .cse583) (= .cse582 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (= .cse583 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))) is different from true [2023-02-15 19:50:46,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700256816] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:50:46,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:50:46,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 51 [2023-02-15 19:50:46,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676059092] [2023-02-15 19:50:46,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:50:46,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 19:50:46,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:50:46,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 19:50:46,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1785, Unknown=41, NotChecked=2060, Total=4032 [2023-02-15 19:50:46,307 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 51 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 42 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:50:46,792 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= 1 .cse0) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse2) (= .cse0 1))) is different from false [2023-02-15 19:50:46,794 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= 1 .cse0) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse2) (= .cse0 1))) is different from true [2023-02-15 19:50:46,798 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse6 .cse5)) (.cse0 (select .cse6 4)) (.cse4 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |c_#valid| .cse2))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1))) (= 1 (select |c_#valid| .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse3 4) 0) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse4) (= (select .cse3 .cse5) 0)))) is different from false [2023-02-15 19:50:46,801 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse6 .cse5)) (.cse0 (select .cse6 4)) (.cse4 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |c_#valid| .cse2))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1))) (= 1 (select |c_#valid| .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse3 4) 0) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse4) (= (select .cse3 .cse5) 0)))) is different from true [2023-02-15 19:50:46,805 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse6 .cse5)) (.cse0 (select .cse6 4)) (.cse4 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |c_#valid| .cse2))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1))) (= 1 (select |c_#valid| .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse3 4) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse4) (= (select .cse3 .cse5) 0)))) is different from false [2023-02-15 19:50:46,808 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse6 .cse5)) (.cse0 (select .cse6 4)) (.cse4 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |c_#valid| .cse2))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1))) (= 1 (select |c_#valid| .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse3 4) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse4) (= (select .cse3 .cse5) 0)))) is different from true [2023-02-15 19:50:46,812 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 1) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (not (= .cse2 |c_ULTIMATE.start_sll_create_#res#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2)) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= 1 .cse0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= 1 (select |c_#valid| .cse2)))) is different from false [2023-02-15 19:50:46,815 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 1) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (not (= .cse2 |c_ULTIMATE.start_sll_create_#res#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2)) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= 1 .cse0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= 1 (select |c_#valid| .cse2)))) is different from true [2023-02-15 19:50:46,819 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|))) (let ((.cse1 (select |c_#valid| .cse3)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_append_~data#1| |c_ULTIMATE.start_main_~data~0#1|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= 1 (select |c_#valid| .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |c_#valid| .cse2))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse1) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0) (not (= .cse0 .cse3))))) is different from false [2023-02-15 19:50:46,821 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|))) (let ((.cse1 (select |c_#valid| .cse3)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_append_~data#1| |c_ULTIMATE.start_main_~data~0#1|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= 1 (select |c_#valid| .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |c_#valid| .cse2))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse1) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0) (not (= .cse0 .cse3))))) is different from true [2023-02-15 19:50:46,826 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#length| |c_old(#length)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_int| |c_old(#memory_int)|)) is different from false [2023-02-15 19:50:46,828 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#length| |c_old(#length)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_int| |c_old(#memory_int)|)) is different from true [2023-02-15 19:50:46,831 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= 0 .cse0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (= |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_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= .cse1 1) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1) |c_#valid|) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_29| .cse2))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1))) (= .cse0 0) (= |c_node_create_~temp~0#1.offset| 0) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from false [2023-02-15 19:50:46,834 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= 0 .cse0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (= |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_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= .cse1 1) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1) |c_#valid|) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_29| .cse2))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1))) (= .cse0 0) (= |c_node_create_~temp~0#1.offset| 0) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-02-15 19:50:46,843 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse3 (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse4 (select |c_old(#valid)| |c_node_create_#res#1.base|))) (and (or .cse0 (= (select |c_old(#valid)| .cse1) 0)) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_node_create_#res#1.offset| 0) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 0) |c_node_create_#in~data#1|) (exists ((v_ArrVal_1751 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_1751))) (= (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2)) |c_#memory_$Pointer$.base|) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or .cse0 (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (= (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1)) |c_#memory_$Pointer$.offset|) (or .cse3 (= |c_node_create_#res#1.base| .cse2)) (exists ((v_ArrVal_1749 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1749))) (= 0 .cse4) (or (<= (+ .cse2 1) |c_#StackHeapBarrier|) .cse3) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5))) |v_#valid_BEFORE_CALL_29|))) (= .cse4 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6))) |c_#valid|))) is different from false [2023-02-15 19:50:46,847 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse3 (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse4 (select |c_old(#valid)| |c_node_create_#res#1.base|))) (and (or .cse0 (= (select |c_old(#valid)| .cse1) 0)) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_node_create_#res#1.offset| 0) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 0) |c_node_create_#in~data#1|) (exists ((v_ArrVal_1751 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_1751))) (= (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2)) |c_#memory_$Pointer$.base|) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or .cse0 (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (= (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1)) |c_#memory_$Pointer$.offset|) (or .cse3 (= |c_node_create_#res#1.base| .cse2)) (exists ((v_ArrVal_1749 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1749))) (= 0 .cse4) (or (<= (+ .cse2 1) |c_#StackHeapBarrier|) .cse3) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5))) |v_#valid_BEFORE_CALL_29|))) (= .cse4 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6))) |c_#valid|))) is different from true [2023-02-15 19:50:46,858 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (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$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| .cse1)) (not (= .cse1 .cse0)) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse2 (select |v_#valid_BEFORE_CALL_29| .cse2))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)))) is different from false [2023-02-15 19:50:46,871 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (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$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| .cse1)) (not (= .cse1 .cse0)) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse2 (select |v_#valid_BEFORE_CALL_29| .cse2))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)))) is different from true [2023-02-15 19:50:46,880 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse1 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| .cse2)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| .cse1) (not (= .cse2 .cse0)) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1))) (<= (+ .cse6 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)))) is different from false [2023-02-15 19:50:46,884 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse1 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| .cse2)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| .cse1) (not (= .cse2 .cse0)) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1))) (<= (+ .cse6 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)))) is different from true [2023-02-15 19:50:46,896 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|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1))) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse5 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse5) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1)) (not (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0)))) is different from false [2023-02-15 19:50:46,900 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|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1))) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse5 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse5) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1)) (not (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0)))) is different from true [2023-02-15 19:50:46,910 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|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 4) 0))))) is different from false [2023-02-15 19:50:46,914 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|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 4) 0))))) is different from true [2023-02-15 19:50:46,923 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|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (= (select .cse7 4) 0))))) is different from false [2023-02-15 19:50:46,927 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|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (= (select .cse7 4) 0))))) is different from true [2023-02-15 19:50:46,938 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|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 4) 0))))) is different from false [2023-02-15 19:50:46,942 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|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 4) 0))))) is different from true [2023-02-15 19:50:46,953 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse11 (+ .cse2 4))) (let ((.cse8 (select .cse9 .cse11)) (.cse10 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse3 (select .cse10 .cse11)) (.cse4 (+ .cse8 4))) (let ((.cse0 (select .cse10 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (= .cse2 0) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) 4)) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse5)) (= (select |v_#valid_BEFORE_CALL_30| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_30| .cse7))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 0))) (= .cse8 0) (or (= (select (select |c_#memory_int| .cse5) 0) |c_ULTIMATE.start_main_~data~0#1|) (= .cse5 .cse3)) (= (select .cse9 4) 0) (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from false [2023-02-15 19:50:46,956 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse11 (+ .cse2 4))) (let ((.cse8 (select .cse9 .cse11)) (.cse10 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse3 (select .cse10 .cse11)) (.cse4 (+ .cse8 4))) (let ((.cse0 (select .cse10 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (= .cse2 0) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) 4)) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse5)) (= (select |v_#valid_BEFORE_CALL_30| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_30| .cse7))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 0))) (= .cse8 0) (or (= (select (select |c_#memory_int| .cse5) 0) |c_ULTIMATE.start_main_~data~0#1|) (= .cse5 .cse3)) (= (select .cse9 4) 0) (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from true [2023-02-15 19:50:46,974 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10))) (and (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) 4)) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (+ .cse6 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9)) (.cse3 (+ .cse7 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 0) (<= (+ .cse2 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse8) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse6) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse8)))))))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10) 0)))) is different from false [2023-02-15 19:50:46,978 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10))) (and (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) 4)) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (+ .cse6 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9)) (.cse3 (+ .cse7 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 0) (<= (+ .cse2 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse8) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse6) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse8)))))))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10) 0)))) is different from true [2023-02-15 19:50:46,990 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse3 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| .cse3) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0)))))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4)) 0) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:50:46,994 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse3 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| .cse3) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0)))))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4)) 0) |c_ULTIMATE.start_main_~data~0#1|)) is different from true [2023-02-15 19:50:47,015 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (+ .cse6 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9)) (.cse3 (+ .cse7 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 0) (<= (+ .cse2 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse8) 1) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse7)))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0) 0))) is different from false [2023-02-15 19:50:47,018 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (+ .cse6 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9)) (.cse3 (+ .cse7 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 0) (<= (+ .cse2 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse8) 1) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse7)))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0) 0))) is different from true [2023-02-15 19:50:47,051 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimIndex_62 Int) (v_arrayElimIndex_61 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_61) 0) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_62) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_61) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| v_arrayElimIndex_62) 0)))) (= (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2023-02-15 19:50:47,053 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimIndex_62 Int) (v_arrayElimIndex_61 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_61) 0) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_62) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_61) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| v_arrayElimIndex_62) 0)))) (= (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|))) is different from true [2023-02-15 19:50:47,095 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= 1 .cse0) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse2) (= .cse0 1))) is different from false [2023-02-15 19:50:47,098 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= 1 .cse0) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse2) (= .cse0 1))) is different from true [2023-02-15 19:50:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:50:47,102 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2023-02-15 19:50:47,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 19:50:47,102 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 42 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2023-02-15 19:50:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:50:47,103 INFO L225 Difference]: With dead ends: 71 [2023-02-15 19:50:47,103 INFO L226 Difference]: Without dead ends: 69 [2023-02-15 19:50:47,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 40 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=216, Invalid=2215, Unknown=81, NotChecked=5320, Total=7832 [2023-02-15 19:50:47,105 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 481 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:50:47,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 301 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 331 Invalid, 0 Unknown, 481 Unchecked, 0.2s Time] [2023-02-15 19:50:47,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-15 19:50:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-02-15 19:50:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 19:50:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2023-02-15 19:50:47,124 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 44 [2023-02-15 19:50:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:50:47,128 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2023-02-15 19:50:47,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 42 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:50:47,129 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2023-02-15 19:50:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 19:50:47,133 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:50:47,133 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:50:47,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 19:50:47,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-15 19:50:47,334 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:50:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:50:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash -820140493, now seen corresponding path program 3 times [2023-02-15 19:50:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:50:47,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328513128] [2023-02-15 19:50:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:50:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:50:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:48,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:50:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:48,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:50:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:48,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:50:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:50:48,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:50:48,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328513128] [2023-02-15 19:50:48,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328513128] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:50:48,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773322579] [2023-02-15 19:50:48,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:50:48,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:50:48,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:50:48,455 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:50:48,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 19:50:48,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 19:50:48,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:50:48,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 166 conjunts are in the unsatisfiable core [2023-02-15 19:50:48,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:50:48,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-15 19:50:48,749 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-15 19:50:48,849 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 13 treesize of output 9 [2023-02-15 19:50:48,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:48,862 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 21 treesize of output 20 [2023-02-15 19:50:49,092 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 19:50:49,092 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 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 19:50:49,097 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 7 treesize of output 3 [2023-02-15 19:50:49,110 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 19:50:49,110 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 19:50:49,115 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-15 19:50:49,137 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:50:49,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:50:49,205 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 13 treesize of output 9 [2023-02-15 19:50:49,212 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 21 treesize of output 20 [2023-02-15 19:50:49,224 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 20 treesize of output 22 [2023-02-15 19:50:49,513 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2023-02-15 19:50:49,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 52 [2023-02-15 19:50:49,524 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 19:50:49,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2023-02-15 19:50:49,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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-15 19:50:49,532 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-15 19:50:49,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:49,744 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 19:50:49,745 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 142 treesize of output 124 [2023-02-15 19:50:49,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:49,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:49,757 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:50:49,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 120 [2023-02-15 19:50:49,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:49,765 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 28 treesize of output 30 [2023-02-15 19:50:49,782 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-02-15 19:50:49,782 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 2 case distinctions, treesize of input 34 treesize of output 36 [2023-02-15 19:50:50,519 INFO L321 Elim1Store]: treesize reduction 239, result has 14.9 percent of original size [2023-02-15 19:50:50,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 396 treesize of output 141 [2023-02-15 19:50:50,545 INFO L321 Elim1Store]: treesize reduction 116, result has 14.1 percent of original size [2023-02-15 19:50:50,545 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 325 treesize of output 175 [2023-02-15 19:50:50,556 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 46 treesize of output 48 [2023-02-15 19:50:51,030 INFO L321 Elim1Store]: treesize reduction 72, result has 72.0 percent of original size [2023-02-15 19:50:51,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 337 treesize of output 321 [2023-02-15 19:50:51,276 INFO L321 Elim1Store]: treesize reduction 64, result has 76.6 percent of original size [2023-02-15 19:50:51,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 299 treesize of output 431 [2023-02-15 19:51:04,111 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-15 19:51:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:51:04,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:51:04,427 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1937 Int) (v_ArrVal_1938 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse4 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse4 v_ArrVal_1937)))) (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|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1938) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) is different from false [2023-02-15 19:51:06,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773322579] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:51:06,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:51:06,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29] total 48 [2023-02-15 19:51:06,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719328648] [2023-02-15 19:51:06,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:51:06,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-15 19:51:06,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:51:06,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-15 19:51:06,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3372, Unknown=3, NotChecked=116, Total=3660 [2023-02-15 19:51:06,557 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 48 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 40 states have internal predecessors, (73), 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-15 19:51:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:51:10,144 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2023-02-15 19:51:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 19:51:10,144 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 40 states have internal predecessors, (73), 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 44 [2023-02-15 19:51:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:51:10,145 INFO L225 Difference]: With dead ends: 84 [2023-02-15 19:51:10,145 INFO L226 Difference]: Without dead ends: 66 [2023-02-15 19:51:10,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=360, Invalid=5191, Unknown=3, NotChecked=146, Total=5700 [2023-02-15 19:51:10,146 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 61 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:51:10,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 457 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 19:51:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-15 19:51:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2023-02-15 19:51:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 19:51:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2023-02-15 19:51:10,163 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 44 [2023-02-15 19:51:10,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:51:10,163 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2023-02-15 19:51:10,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 40 states have internal predecessors, (73), 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-15 19:51:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2023-02-15 19:51:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 19:51:10,163 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:51:10,164 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:51:10,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 19:51:10,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-15 19:51:10,364 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:51:10,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:51:10,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1518413252, now seen corresponding path program 3 times [2023-02-15 19:51:10,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:51:10,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246804219] [2023-02-15 19:51:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:51:10,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:51:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:10,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:51:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:10,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:51:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:10,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:51:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-15 19:51:10,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:51:10,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246804219] [2023-02-15 19:51:10,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246804219] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:51:10,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408216589] [2023-02-15 19:51:10,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:51:10,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:51:10,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:51:10,506 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:51:10,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 19:51:10,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 19:51:10,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:51:10,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 19:51:10,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:51:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-15 19:51:10,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:51:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-15 19:51:10,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408216589] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:51:10,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:51:10,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-02-15 19:51:10,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035349544] [2023-02-15 19:51:10,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:51:10,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 19:51:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:51:10,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 19:51:10,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:51:10,986 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 19:51:11,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:51:11,065 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-02-15 19:51:11,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 19:51:11,065 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2023-02-15 19:51:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:51:11,066 INFO L225 Difference]: With dead ends: 80 [2023-02-15 19:51:11,066 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 19:51:11,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:51:11,068 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 27 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:51:11,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 207 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:51:11,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 19:51:11,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2023-02-15 19:51:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 19:51:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2023-02-15 19:51:11,090 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 46 [2023-02-15 19:51:11,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:51:11,090 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2023-02-15 19:51:11,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 19:51:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2023-02-15 19:51:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 19:51:11,092 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:51:11,092 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:51:11,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 19:51:11,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 19:51:11,298 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:51:11,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:51:11,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1518414926, now seen corresponding path program 4 times [2023-02-15 19:51:11,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:51:11,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276060731] [2023-02-15 19:51:11,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:51:11,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:51:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:12,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:51:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:12,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:51:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:51:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:51:13,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:51:13,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276060731] [2023-02-15 19:51:13,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276060731] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:51:13,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056341674] [2023-02-15 19:51:13,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 19:51:13,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:51:13,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:51:13,030 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:51:13,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 19:51:13,203 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 19:51:13,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:51:13,207 WARN L261 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 198 conjunts are in the unsatisfiable core [2023-02-15 19:51:13,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:51:13,273 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-15 19:51:13,435 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 13 treesize of output 9 [2023-02-15 19:51:13,446 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 13 treesize of output 9 [2023-02-15 19:51:13,550 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-15 19:51:13,554 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-15 19:51:13,557 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-15 19:51:13,779 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:51:13,779 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-15 19:51:13,789 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 16 treesize of output 18 [2023-02-15 19:51:13,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 16 treesize of output 18 [2023-02-15 19:51:13,885 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 21 treesize of output 20 [2023-02-15 19:51:13,895 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 26 [2023-02-15 19:51:14,274 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:51:14,274 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 44 [2023-02-15 19:51:14,279 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-15 19:51:14,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:14,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:14,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-15 19:51:14,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:14,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:14,447 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 19:51:14,447 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 83 [2023-02-15 19:51:14,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:14,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:14,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:14,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:14,474 INFO L321 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2023-02-15 19:51:14,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 57 [2023-02-15 19:51:14,511 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:51:14,512 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-15 19:51:15,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:15,290 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:51:15,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:15,329 INFO L321 Elim1Store]: treesize reduction 192, result has 13.9 percent of original size [2023-02-15 19:51:15,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 209 treesize of output 127 [2023-02-15 19:51:15,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:15,383 INFO L321 Elim1Store]: treesize reduction 215, result has 14.7 percent of original size [2023-02-15 19:51:15,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 13 case distinctions, treesize of input 329 treesize of output 211 [2023-02-15 19:51:16,201 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:51:16,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:16,239 INFO L321 Elim1Store]: treesize reduction 204, result has 6.4 percent of original size [2023-02-15 19:51:16,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 15 new quantified variables, introduced 21 case distinctions, treesize of input 462 treesize of output 195 [2023-02-15 19:51:16,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:16,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:16,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:16,262 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2023-02-15 19:51:16,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 61 [2023-02-15 19:51:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:51:16,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:51:16,942 INFO L321 Elim1Store]: treesize reduction 4, result has 95.8 percent of original size [2023-02-15 19:51:16,943 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 99 [2023-02-15 19:51:25,192 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2276 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse0 (select (select .cse16 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse0) (forall ((v_ArrVal_2277 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse17 (select (select .cse14 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse18 (+ .cse0 4))) (let ((.cse15 (select (select .cse14 .cse17) .cse18))) (let ((.cse9 (select .cse16 .cse15)) (.cse8 (+ (select (select .cse16 .cse17) .cse18) 4))) (let ((.cse7 (select .cse14 .cse15)) (.cse5 (store .cse16 .cse15 (store .cse9 .cse8 0)))) (let ((.cse10 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (store .cse14 .cse15 (store .cse7 .cse8 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse4 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ .cse10 4))) (let ((.cse11 (select (select .cse1 .cse4) .cse13)) (.cse12 (+ (select (select .cse5 .cse4) .cse13) 4))) (let ((.cse6 (select (select .cse5 .cse11) .cse12))) (let ((.cse2 (select (select .cse1 .cse11) .cse12)) (.cse3 (+ .cse6 4))) (or (= (select (select .cse1 .cse2) .cse3) .cse4) (= (select (select .cse5 .cse2) .cse3) 0) (= .cse6 0) (not (= 0 (select .cse7 .cse8))) (not (= (select .cse9 .cse8) 0)) (= .cse10 0))))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2277 Int)) (let ((.cse30 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse33 (select (select .cse30 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse32 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse34 (+ (select (select .cse32 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse31 (select (select .cse30 .cse33) .cse34))) (let ((.cse21 (select .cse30 .cse31)) (.cse23 (select .cse32 .cse31)) (.cse22 (+ (select (select .cse32 .cse33) .cse34) 4))) (let ((.cse26 (store .cse32 .cse31 (store .cse23 .cse22 0))) (.cse25 (store .cse30 .cse31 (store .cse21 .cse22 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse20 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse29 (+ (select (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse27 (select (select .cse25 .cse20) .cse29)) (.cse28 (+ (select (select .cse26 .cse20) .cse29) 4))) (let ((.cse24 (select (select .cse25 .cse27) .cse28))) (let ((.cse19 (select (select .cse25 .cse24) (+ (select (select .cse26 .cse27) .cse28) 4)))) (or (= .cse19 .cse20) (= .cse20 0) (not (= 0 (select .cse21 .cse22))) (not (= (select .cse23 .cse22) 0)) (= .cse24 0) (= .cse19 0)))))))))))) (= 0 .cse33))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse50 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse35 (select (select .cse50 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse35) (forall ((v_ArrVal_2277 Int)) (let ((.cse48 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse51 (select (select .cse48 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse52 (+ .cse35 4))) (let ((.cse49 (select (select .cse48 .cse51) .cse52))) (let ((.cse41 (select .cse50 .cse49)) (.cse40 (+ (select (select .cse50 .cse51) .cse52) 4))) (let ((.cse39 (select .cse48 .cse49)) (.cse46 (store .cse50 .cse49 (store .cse41 .cse40 0)))) (let ((.cse42 (select (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse43 (store .cse48 .cse49 (store .cse39 .cse40 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse37 (select (select .cse43 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse47 (+ .cse42 4))) (let ((.cse44 (select (select .cse43 .cse37) .cse47)) (.cse45 (+ (select (select .cse46 .cse37) .cse47) 4))) (let ((.cse38 (select (select .cse46 .cse44) .cse45))) (let ((.cse36 (select (select .cse43 (select (select .cse43 .cse44) .cse45)) (+ .cse38 4)))) (or (= .cse36 .cse37) (= .cse38 0) (not (= 0 (select .cse39 .cse40))) (not (= (select .cse41 .cse40) 0)) (= .cse42 0) (= .cse36 0))))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse65 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse53 (select (select .cse65 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse53) (forall ((v_ArrVal_2276 Int)) (let ((.cse67 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse68 (+ (select (select .cse67 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse66 (select (select .cse65 .cse53) .cse68))) (let ((.cse57 (select .cse65 .cse66)) (.cse59 (select .cse67 .cse66)) (.cse58 (+ (select (select .cse67 .cse53) .cse68) 4))) (let ((.cse63 (store .cse67 .cse66 (store .cse59 .cse58 0))) (.cse60 (store .cse65 .cse66 (store .cse57 .cse58 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse55 (select (select .cse60 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse64 (+ (select (select .cse63 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse61 (select (select .cse60 .cse55) .cse64)) (.cse62 (+ (select (select .cse63 .cse55) .cse64) 4))) (let ((.cse56 (select (select .cse63 .cse61) .cse62))) (let ((.cse54 (select (select .cse60 (select (select .cse60 .cse61) .cse62)) (+ .cse56 4)))) (or (= .cse54 .cse55) (= .cse55 0) (= .cse56 0) (not (= 0 (select .cse57 .cse58))) (not (= (select .cse59 .cse58) 0)) (= .cse54 0)))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse82 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse69 (select (select .cse82 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse69) (forall ((v_ArrVal_2276 Int)) (let ((.cse84 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse85 (+ (select (select .cse84 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse83 (select (select .cse82 .cse69) .cse85))) (let ((.cse75 (select .cse84 .cse83)) (.cse74 (+ (select (select .cse84 .cse69) .cse85) 4))) (let ((.cse73 (select .cse82 .cse83)) (.cse76 (store .cse84 .cse83 (store .cse75 .cse74 0)))) (let ((.cse71 (select (select .cse76 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse77 (store .cse82 .cse83 (store .cse73 .cse74 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse80 (select (select .cse77 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse81 (+ .cse71 4))) (let ((.cse78 (select (select .cse77 .cse80) .cse81)) (.cse79 (+ (select (select .cse76 .cse80) .cse81) 4))) (let ((.cse72 (select (select .cse76 .cse78) .cse79))) (let ((.cse70 (select (select .cse76 (select (select .cse77 .cse78) .cse79)) (+ .cse72 4)))) (or (= .cse70 .cse71) (= .cse70 0) (= .cse72 0) (not (= 0 (select .cse73 .cse74))) (not (= (select .cse75 .cse74) 0)) (= .cse71 0))))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2277 Int)) (let ((.cse99 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse86 (select (select .cse99 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse86) (forall ((v_ArrVal_2276 Int)) (let ((.cse101 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse102 (+ (select (select .cse101 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse100 (select (select .cse99 .cse86) .cse102))) (let ((.cse92 (select .cse101 .cse100)) (.cse91 (+ (select (select .cse101 .cse86) .cse102) 4))) (let ((.cse90 (select .cse99 .cse100)) (.cse97 (store .cse101 .cse100 (store .cse92 .cse91 0)))) (let ((.cse93 (select (select .cse97 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse94 (store .cse99 .cse100 (store .cse90 .cse91 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse88 (select (select .cse94 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse98 (+ .cse93 4))) (let ((.cse95 (select (select .cse94 .cse88) .cse98)) (.cse96 (+ (select (select .cse97 .cse88) .cse98) 4))) (let ((.cse89 (select (select .cse97 .cse95) .cse96))) (let ((.cse87 (select (select .cse94 (select (select .cse94 .cse95) .cse96)) (+ .cse89 4)))) (or (= .cse87 .cse88) (= .cse89 0) (not (= 0 (select .cse90 .cse91))) (not (= (select .cse92 .cse91) 0)) (= .cse93 0) (= .cse87 0))))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2276 Int)) (let ((.cse118 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse103 (select (select .cse118 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse103) (forall ((v_ArrVal_2277 Int)) (let ((.cse116 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse119 (select (select .cse116 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse120 (+ .cse103 4))) (let ((.cse117 (select (select .cse116 .cse119) .cse120))) (let ((.cse111 (select .cse118 .cse117)) (.cse110 (+ (select (select .cse118 .cse119) .cse120) 4))) (let ((.cse109 (select .cse116 .cse117)) (.cse108 (store .cse118 .cse117 (store .cse111 .cse110 0)))) (let ((.cse112 (select (select .cse108 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse104 (store .cse116 .cse117 (store .cse109 .cse110 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse107 (select (select .cse104 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse115 (+ .cse112 4))) (let ((.cse113 (select (select .cse104 .cse107) .cse115)) (.cse114 (+ (select (select .cse108 .cse107) .cse115) 4))) (let ((.cse106 (+ (select (select .cse108 .cse113) .cse114) 4)) (.cse105 (select (select .cse104 .cse113) .cse114))) (or (= (select (select .cse104 .cse105) .cse106) .cse107) (= (select (select .cse108 .cse105) .cse106) 0) (not (= 0 (select .cse109 .cse110))) (not (= (select .cse111 .cse110) 0)) (= .cse105 0) (= .cse112 0)))))))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2276 Int)) (let ((.cse135 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse121 (select (select .cse135 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse121) (forall ((v_ArrVal_2277 Int)) (let ((.cse133 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse136 (select (select .cse133 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse137 (+ .cse121 4))) (let ((.cse134 (select (select .cse133 .cse136) .cse137))) (let ((.cse125 (select .cse133 .cse134)) (.cse127 (select .cse135 .cse134)) (.cse126 (+ (select (select .cse135 .cse136) .cse137) 4))) (let ((.cse131 (store .cse135 .cse134 (store .cse127 .cse126 0))) (.cse128 (store .cse133 .cse134 (store .cse125 .cse126 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse123 (select (select .cse128 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse132 (+ (select (select .cse131 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse129 (select (select .cse128 .cse123) .cse132)) (.cse130 (+ (select (select .cse131 .cse123) .cse132) 4))) (let ((.cse124 (select (select .cse131 .cse129) .cse130))) (let ((.cse122 (select (select .cse128 (select (select .cse128 .cse129) .cse130)) (+ .cse124 4)))) (or (= .cse122 .cse123) (= .cse123 0) (= .cse124 0) (not (= 0 (select .cse125 .cse126))) (not (= (select .cse127 .cse126) 0)) (= .cse122 0)))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse151 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse138 (select (select .cse151 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse138) (forall ((v_ArrVal_2276 Int)) (let ((.cse153 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse154 (+ (select (select .cse153 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse152 (select (select .cse151 .cse138) .cse154))) (let ((.cse143 (select .cse153 .cse152)) (.cse142 (+ (select (select .cse153 .cse138) .cse154) 4))) (let ((.cse141 (select .cse151 .cse152)) (.cse145 (store .cse153 .cse152 (store .cse143 .cse142 0)))) (let ((.cse140 (select (select .cse145 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse148 (store .cse151 .cse152 (store .cse141 .cse142 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse149 (select (select .cse148 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse150 (+ .cse140 4))) (let ((.cse146 (select (select .cse148 .cse149) .cse150)) (.cse147 (+ (select (select .cse145 .cse149) .cse150) 4))) (let ((.cse144 (select (select .cse148 .cse146) .cse147))) (let ((.cse139 (select (select .cse145 .cse144) (+ (select (select .cse145 .cse146) .cse147) 4)))) (or (= .cse139 .cse140) (= .cse139 0) (not (= 0 (select .cse141 .cse142))) (not (= (select .cse143 .cse142) 0)) (= .cse144 0) (= .cse140 0))))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse169 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse155 (select (select .cse169 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse155) (forall ((v_ArrVal_2277 Int)) (let ((.cse167 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse170 (select (select .cse167 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse171 (+ .cse155 4))) (let ((.cse168 (select (select .cse167 .cse170) .cse171))) (let ((.cse161 (select .cse167 .cse168)) (.cse163 (select .cse169 .cse168)) (.cse162 (+ (select (select .cse169 .cse170) .cse171) 4))) (let ((.cse160 (store .cse169 .cse168 (store .cse163 .cse162 0))) (.cse156 (store .cse167 .cse168 (store .cse161 .cse162 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse159 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse166 (+ (select (select .cse160 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse164 (select (select .cse156 .cse159) .cse166)) (.cse165 (+ (select (select .cse160 .cse159) .cse166) 4))) (let ((.cse158 (+ (select (select .cse160 .cse164) .cse165) 4)) (.cse157 (select (select .cse156 .cse164) .cse165))) (or (= (select (select .cse156 .cse157) .cse158) .cse159) (= .cse159 0) (= (select (select .cse160 .cse157) .cse158) 0) (not (= 0 (select .cse161 .cse162))) (not (= (select .cse163 .cse162) 0)) (= .cse157 0))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2277 Int)) (let ((.cse185 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse188 (select (select .cse185 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse187 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse189 (+ (select (select .cse187 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse186 (select (select .cse185 .cse188) .cse189))) (let ((.cse179 (select .cse187 .cse186)) (.cse178 (+ (select (select .cse187 .cse188) .cse189) 4))) (let ((.cse177 (select .cse185 .cse186)) (.cse172 (store .cse187 .cse186 (store .cse179 .cse178 0)))) (let ((.cse175 (select (select .cse172 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse180 (store .cse185 .cse186 (store .cse177 .cse178 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse183 (select (select .cse180 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse184 (+ .cse175 4))) (let ((.cse181 (select (select .cse180 .cse183) .cse184)) (.cse182 (+ (select (select .cse172 .cse183) .cse184) 4))) (let ((.cse176 (select (select .cse172 .cse181) .cse182))) (let ((.cse173 (select (select .cse180 .cse181) .cse182)) (.cse174 (+ .cse176 4))) (or (= (select (select .cse172 .cse173) .cse174) .cse175) (= .cse176 0) (not (= 0 (select .cse177 .cse178))) (not (= (select .cse179 .cse178) 0)) (= .cse175 0) (= (select (select .cse180 .cse173) .cse174) 0))))))))))))) (= 0 .cse188))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse204 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse207 (select (select .cse204 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse202 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse205 (select (select .cse202 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse206 (+ .cse207 4))) (let ((.cse203 (select (select .cse202 .cse205) .cse206))) (let ((.cse196 (select .cse202 .cse203)) (.cse198 (select .cse204 .cse203)) (.cse197 (+ (select (select .cse204 .cse205) .cse206) 4))) (let ((.cse194 (store .cse204 .cse203 (store .cse198 .cse197 0))) (.cse190 (store .cse202 .cse203 (store .cse196 .cse197 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse193 (select (select .cse190 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse201 (+ (select (select .cse194 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse199 (select (select .cse190 .cse193) .cse201)) (.cse200 (+ (select (select .cse194 .cse193) .cse201) 4))) (let ((.cse195 (select (select .cse194 .cse199) .cse200))) (let ((.cse191 (select (select .cse190 .cse199) .cse200)) (.cse192 (+ .cse195 4))) (or (= (select (select .cse190 .cse191) .cse192) .cse193) (= .cse193 0) (= (select (select .cse194 .cse191) .cse192) 0) (= .cse195 0) (not (= 0 (select .cse196 .cse197))) (not (= (select .cse198 .cse197) 0))))))))))))) (= 0 .cse207))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse222 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse225 (select (select .cse222 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse220 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse223 (select (select .cse220 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse224 (+ .cse225 4))) (let ((.cse221 (select (select .cse220 .cse223) .cse224))) (let ((.cse213 (select .cse222 .cse221)) (.cse212 (+ (select (select .cse222 .cse223) .cse224) 4))) (let ((.cse211 (select .cse220 .cse221)) (.cse214 (store .cse222 .cse221 (store .cse213 .cse212 0)))) (let ((.cse209 (select (select .cse214 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse215 (store .cse220 .cse221 (store .cse211 .cse212 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse218 (select (select .cse215 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse219 (+ .cse209 4))) (let ((.cse216 (select (select .cse215 .cse218) .cse219)) (.cse217 (+ (select (select .cse214 .cse218) .cse219) 4))) (let ((.cse210 (select (select .cse214 .cse216) .cse217))) (let ((.cse208 (select (select .cse214 (select (select .cse215 .cse216) .cse217)) (+ .cse210 4)))) (or (= .cse208 .cse209) (= .cse208 0) (= .cse210 0) (not (= 0 (select .cse211 .cse212))) (not (= (select .cse213 .cse212) 0)) (= .cse209 0))))))))))))) (= 0 .cse225))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2276 Int)) (let ((.cse241 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse244 (select (select .cse241 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse239 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse242 (select (select .cse239 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse243 (+ .cse244 4))) (let ((.cse240 (select (select .cse239 .cse242) .cse243))) (let ((.cse234 (select .cse241 .cse240)) (.cse233 (+ (select (select .cse241 .cse242) .cse243) 4))) (let ((.cse232 (select .cse239 .cse240)) (.cse227 (store .cse241 .cse240 (store .cse234 .cse233 0)))) (let ((.cse230 (select (select .cse227 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse235 (store .cse239 .cse240 (store .cse232 .cse233 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse226 (select (select .cse235 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse238 (+ .cse230 4))) (let ((.cse236 (select (select .cse235 .cse226) .cse238)) (.cse237 (+ (select (select .cse227 .cse226) .cse238) 4))) (let ((.cse231 (select (select .cse227 .cse236) .cse237))) (let ((.cse228 (select (select .cse235 .cse236) .cse237)) (.cse229 (+ .cse231 4))) (or (= .cse226 0) (= (select (select .cse227 .cse228) .cse229) .cse230) (= .cse231 0) (not (= 0 (select .cse232 .cse233))) (not (= (select .cse234 .cse233) 0)) (= (select (select .cse235 .cse228) .cse229) 0))))))))))))) (= 0 .cse244))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse260 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse245 (select (select .cse260 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse245) (forall ((v_ArrVal_2277 Int)) (let ((.cse258 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse261 (select (select .cse258 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse262 (+ .cse245 4))) (let ((.cse259 (select (select .cse258 .cse261) .cse262))) (let ((.cse252 (select .cse260 .cse259)) (.cse251 (+ (select (select .cse260 .cse261) .cse262) 4))) (let ((.cse250 (select .cse258 .cse259)) (.cse253 (store .cse260 .cse259 (store .cse252 .cse251 0)))) (let ((.cse248 (select (select .cse253 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse254 (store .cse258 .cse259 (store .cse250 .cse251 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse246 (select (select .cse254 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse257 (+ .cse248 4))) (let ((.cse255 (select (select .cse254 .cse246) .cse257)) (.cse256 (+ (select (select .cse253 .cse246) .cse257) 4))) (let ((.cse249 (select (select .cse253 .cse255) .cse256))) (let ((.cse247 (select (select .cse253 (select (select .cse254 .cse255) .cse256)) (+ .cse249 4)))) (or (= .cse246 0) (= .cse247 .cse248) (= .cse247 0) (= .cse249 0) (not (= 0 (select .cse250 .cse251))) (not (= (select .cse252 .cse251) 0)))))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2277 Int)) (let ((.cse275 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse278 (select (select .cse275 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse277 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse279 (+ (select (select .cse277 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse276 (select (select .cse275 .cse278) .cse279))) (let ((.cse269 (select .cse277 .cse276)) (.cse268 (+ (select (select .cse277 .cse278) .cse279) 4))) (let ((.cse267 (select .cse275 .cse276)) (.cse270 (store .cse277 .cse276 (store .cse269 .cse268 0)))) (let ((.cse265 (select (select .cse270 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse271 (store .cse275 .cse276 (store .cse267 .cse268 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse263 (select (select .cse271 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse274 (+ .cse265 4))) (let ((.cse272 (select (select .cse271 .cse263) .cse274)) (.cse273 (+ (select (select .cse270 .cse263) .cse274) 4))) (let ((.cse266 (select (select .cse270 .cse272) .cse273))) (let ((.cse264 (select (select .cse270 (select (select .cse271 .cse272) .cse273)) (+ .cse266 4)))) (or (= .cse263 0) (= .cse264 .cse265) (= .cse264 0) (= .cse266 0) (not (= 0 (select .cse267 .cse268))) (not (= (select .cse269 .cse268) 0)))))))))))))) (= 0 .cse278))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2276 Int)) (let ((.cse295 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse280 (select (select .cse295 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse280) (forall ((v_ArrVal_2277 Int)) (let ((.cse293 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse296 (select (select .cse293 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse297 (+ .cse280 4))) (let ((.cse294 (select (select .cse293 .cse296) .cse297))) (let ((.cse285 (select .cse295 .cse294)) (.cse284 (+ (select (select .cse295 .cse296) .cse297) 4))) (let ((.cse283 (select .cse293 .cse294)) (.cse289 (store .cse295 .cse294 (store .cse285 .cse284 0)))) (let ((.cse287 (select (select .cse289 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse288 (store .cse293 .cse294 (store .cse283 .cse284 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse282 (select (select .cse288 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse292 (+ .cse287 4))) (let ((.cse290 (select (select .cse288 .cse282) .cse292)) (.cse291 (+ (select (select .cse289 .cse282) .cse292) 4))) (let ((.cse286 (select (select .cse288 .cse290) .cse291))) (let ((.cse281 (select (select .cse288 .cse286) (+ (select (select .cse289 .cse290) .cse291) 4)))) (or (= .cse281 .cse282) (not (= 0 (select .cse283 .cse284))) (not (= (select .cse285 .cse284) 0)) (= .cse286 0) (= .cse287 0) (= .cse281 0))))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2276 Int)) (let ((.cse312 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse298 (select (select .cse312 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse298) (forall ((v_ArrVal_2277 Int)) (let ((.cse310 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse313 (select (select .cse310 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse314 (+ .cse298 4))) (let ((.cse311 (select (select .cse310 .cse313) .cse314))) (let ((.cse301 (select .cse310 .cse311)) (.cse303 (select .cse312 .cse311)) (.cse302 (+ (select (select .cse312 .cse313) .cse314) 4))) (let ((.cse306 (store .cse312 .cse311 (store .cse303 .cse302 0))) (.cse305 (store .cse310 .cse311 (store .cse301 .cse302 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse300 (select (select .cse305 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse309 (+ (select (select .cse306 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse307 (select (select .cse305 .cse300) .cse309)) (.cse308 (+ (select (select .cse306 .cse300) .cse309) 4))) (let ((.cse304 (select (select .cse305 .cse307) .cse308))) (let ((.cse299 (select (select .cse305 .cse304) (+ (select (select .cse306 .cse307) .cse308) 4)))) (or (= .cse299 .cse300) (= .cse300 0) (not (= 0 (select .cse301 .cse302))) (not (= (select .cse303 .cse302) 0)) (= .cse304 0) (= .cse299 0)))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse328 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse315 (select (select .cse328 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse315) (forall ((v_ArrVal_2276 Int)) (let ((.cse330 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse331 (+ (select (select .cse330 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse329 (select (select .cse328 .cse315) .cse331))) (let ((.cse323 (select .cse330 .cse329)) (.cse322 (+ (select (select .cse330 .cse315) .cse331) 4))) (let ((.cse321 (select .cse328 .cse329)) (.cse317 (store .cse330 .cse329 (store .cse323 .cse322 0)))) (let ((.cse320 (select (select .cse317 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse324 (store .cse328 .cse329 (store .cse321 .cse322 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse316 (select (select .cse324 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse327 (+ .cse320 4))) (let ((.cse325 (select (select .cse324 .cse316) .cse327)) (.cse326 (+ (select (select .cse317 .cse316) .cse327) 4))) (let ((.cse318 (select (select .cse324 .cse325) .cse326)) (.cse319 (+ (select (select .cse317 .cse325) .cse326) 4))) (or (= .cse316 0) (= (select (select .cse317 .cse318) .cse319) .cse320) (not (= 0 (select .cse321 .cse322))) (not (= (select .cse323 .cse322) 0)) (= .cse318 0) (= (select (select .cse324 .cse318) .cse319) 0)))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse345 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse332 (select (select .cse345 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse332) (forall ((v_ArrVal_2276 Int)) (let ((.cse347 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse348 (+ (select (select .cse347 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse346 (select (select .cse345 .cse332) .cse348))) (let ((.cse340 (select .cse347 .cse346)) (.cse339 (+ (select (select .cse347 .cse332) .cse348) 4))) (let ((.cse338 (select .cse345 .cse346)) (.cse337 (store .cse347 .cse346 (store .cse340 .cse339 0)))) (let ((.cse341 (select (select .cse337 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse333 (store .cse345 .cse346 (store .cse338 .cse339 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse336 (select (select .cse333 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse344 (+ .cse341 4))) (let ((.cse342 (select (select .cse333 .cse336) .cse344)) (.cse343 (+ (select (select .cse337 .cse336) .cse344) 4))) (let ((.cse335 (+ (select (select .cse337 .cse342) .cse343) 4)) (.cse334 (select (select .cse333 .cse342) .cse343))) (or (= (select (select .cse333 .cse334) .cse335) .cse336) (= (select (select .cse337 .cse334) .cse335) 0) (not (= 0 (select .cse338 .cse339))) (not (= (select .cse340 .cse339) 0)) (= .cse334 0) (= .cse341 0)))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2276 Int)) (let ((.cse364 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse349 (select (select .cse364 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse349) (forall ((v_ArrVal_2277 Int)) (let ((.cse362 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse365 (select (select .cse362 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse366 (+ .cse349 4))) (let ((.cse363 (select (select .cse362 .cse365) .cse366))) (let ((.cse355 (select .cse364 .cse363)) (.cse354 (+ (select (select .cse364 .cse365) .cse366) 4))) (let ((.cse353 (select .cse362 .cse363)) (.cse357 (store .cse364 .cse363 (store .cse355 .cse354 0)))) (let ((.cse352 (select (select .cse357 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse360 (store .cse362 .cse363 (store .cse353 .cse354 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse350 (select (select .cse360 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse361 (+ .cse352 4))) (let ((.cse358 (select (select .cse360 .cse350) .cse361)) (.cse359 (+ (select (select .cse357 .cse350) .cse361) 4))) (let ((.cse356 (select (select .cse360 .cse358) .cse359))) (let ((.cse351 (select (select .cse357 .cse356) (+ (select (select .cse357 .cse358) .cse359) 4)))) (or (= .cse350 0) (= .cse351 .cse352) (= .cse351 0) (not (= 0 (select .cse353 .cse354))) (not (= (select .cse355 .cse354) 0)) (= .cse356 0))))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse380 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse367 (select (select .cse380 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse367) (forall ((v_ArrVal_2276 Int)) (let ((.cse382 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse383 (+ (select (select .cse382 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse381 (select (select .cse380 .cse367) .cse383))) (let ((.cse372 (select .cse382 .cse381)) (.cse371 (+ (select (select .cse382 .cse367) .cse383) 4))) (let ((.cse370 (select .cse380 .cse381)) (.cse376 (store .cse382 .cse381 (store .cse372 .cse371 0)))) (let ((.cse374 (select (select .cse376 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse375 (store .cse380 .cse381 (store .cse370 .cse371 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse369 (select (select .cse375 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse379 (+ .cse374 4))) (let ((.cse377 (select (select .cse375 .cse369) .cse379)) (.cse378 (+ (select (select .cse376 .cse369) .cse379) 4))) (let ((.cse373 (select (select .cse375 .cse377) .cse378))) (let ((.cse368 (select (select .cse375 .cse373) (+ (select (select .cse376 .cse377) .cse378) 4)))) (or (= .cse368 .cse369) (not (= 0 (select .cse370 .cse371))) (not (= (select .cse372 .cse371) 0)) (= .cse373 0) (= .cse374 0) (= .cse368 0))))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2277 Int)) (let ((.cse397 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse384 (select (select .cse397 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse384) (forall ((v_ArrVal_2276 Int)) (let ((.cse399 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse400 (+ (select (select .cse399 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse398 (select (select .cse397 .cse384) .cse400))) (let ((.cse391 (select .cse397 .cse398)) (.cse393 (select .cse399 .cse398)) (.cse392 (+ (select (select .cse399 .cse384) .cse400) 4))) (let ((.cse389 (store .cse399 .cse398 (store .cse393 .cse392 0))) (.cse385 (store .cse397 .cse398 (store .cse391 .cse392 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse388 (select (select .cse385 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse396 (+ (select (select .cse389 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse394 (select (select .cse385 .cse388) .cse396)) (.cse395 (+ (select (select .cse389 .cse388) .cse396) 4))) (let ((.cse390 (select (select .cse389 .cse394) .cse395))) (let ((.cse386 (select (select .cse385 .cse394) .cse395)) (.cse387 (+ .cse390 4))) (or (= (select (select .cse385 .cse386) .cse387) .cse388) (= .cse388 0) (= (select (select .cse389 .cse386) .cse387) 0) (= .cse390 0) (not (= 0 (select .cse391 .cse392))) (not (= (select .cse393 .cse392) 0))))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse416 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse401 (select (select .cse416 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse401) (forall ((v_ArrVal_2277 Int)) (let ((.cse414 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse417 (select (select .cse414 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse418 (+ .cse401 4))) (let ((.cse415 (select (select .cse414 .cse417) .cse418))) (let ((.cse409 (select .cse416 .cse415)) (.cse408 (+ (select (select .cse416 .cse417) .cse418) 4))) (let ((.cse407 (select .cse414 .cse415)) (.cse403 (store .cse416 .cse415 (store .cse409 .cse408 0)))) (let ((.cse406 (select (select .cse403 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse410 (store .cse414 .cse415 (store .cse407 .cse408 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse402 (select (select .cse410 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse413 (+ .cse406 4))) (let ((.cse411 (select (select .cse410 .cse402) .cse413)) (.cse412 (+ (select (select .cse403 .cse402) .cse413) 4))) (let ((.cse404 (select (select .cse410 .cse411) .cse412)) (.cse405 (+ (select (select .cse403 .cse411) .cse412) 4))) (or (= .cse402 0) (= (select (select .cse403 .cse404) .cse405) .cse406) (not (= 0 (select .cse407 .cse408))) (not (= (select .cse409 .cse408) 0)) (= .cse404 0) (= (select (select .cse410 .cse404) .cse405) 0)))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse433 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse419 (select (select .cse433 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse419) (forall ((v_ArrVal_2276 Int)) (let ((.cse435 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse436 (+ (select (select .cse435 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse434 (select (select .cse433 .cse419) .cse436))) (let ((.cse428 (select .cse435 .cse434)) (.cse427 (+ (select (select .cse435 .cse419) .cse436) 4))) (let ((.cse426 (select .cse433 .cse434)) (.cse421 (store .cse435 .cse434 (store .cse428 .cse427 0)))) (let ((.cse424 (select (select .cse421 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse429 (store .cse433 .cse434 (store .cse426 .cse427 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse420 (select (select .cse429 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse432 (+ .cse424 4))) (let ((.cse430 (select (select .cse429 .cse420) .cse432)) (.cse431 (+ (select (select .cse421 .cse420) .cse432) 4))) (let ((.cse425 (select (select .cse421 .cse430) .cse431))) (let ((.cse422 (select (select .cse429 .cse430) .cse431)) (.cse423 (+ .cse425 4))) (or (= .cse420 0) (= (select (select .cse421 .cse422) .cse423) .cse424) (= .cse425 0) (not (= 0 (select .cse426 .cse427))) (not (= (select .cse428 .cse427) 0)) (= (select (select .cse429 .cse422) .cse423) 0))))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse449 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse452 (select (select .cse449 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse451 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse453 (+ (select (select .cse451 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse450 (select (select .cse449 .cse452) .cse453))) (let ((.cse442 (select .cse451 .cse450)) (.cse441 (+ (select (select .cse451 .cse452) .cse453) 4))) (let ((.cse440 (select .cse449 .cse450)) (.cse444 (store .cse451 .cse450 (store .cse442 .cse441 0)))) (let ((.cse439 (select (select .cse444 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse447 (store .cse449 .cse450 (store .cse440 .cse441 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse437 (select (select .cse447 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse448 (+ .cse439 4))) (let ((.cse445 (select (select .cse447 .cse437) .cse448)) (.cse446 (+ (select (select .cse444 .cse437) .cse448) 4))) (let ((.cse443 (select (select .cse447 .cse445) .cse446))) (let ((.cse438 (select (select .cse444 .cse443) (+ (select (select .cse444 .cse445) .cse446) 4)))) (or (= .cse437 0) (= .cse438 .cse439) (= .cse438 0) (not (= 0 (select .cse440 .cse441))) (not (= (select .cse442 .cse441) 0)) (= .cse443 0))))))))))))) (= 0 .cse452))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2276 Int)) (let ((.cse469 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse454 (select (select .cse469 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse454) (forall ((v_ArrVal_2277 Int)) (let ((.cse467 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse470 (select (select .cse467 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse471 (+ .cse454 4))) (let ((.cse468 (select (select .cse467 .cse470) .cse471))) (let ((.cse459 (select .cse469 .cse468)) (.cse458 (+ (select (select .cse469 .cse470) .cse471) 4))) (let ((.cse457 (select .cse467 .cse468)) (.cse461 (store .cse469 .cse468 (store .cse459 .cse458 0)))) (let ((.cse456 (select (select .cse461 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse464 (store .cse467 .cse468 (store .cse457 .cse458 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse465 (select (select .cse464 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse466 (+ .cse456 4))) (let ((.cse462 (select (select .cse464 .cse465) .cse466)) (.cse463 (+ (select (select .cse461 .cse465) .cse466) 4))) (let ((.cse460 (select (select .cse464 .cse462) .cse463))) (let ((.cse455 (select (select .cse461 .cse460) (+ (select (select .cse461 .cse462) .cse463) 4)))) (or (= .cse455 .cse456) (= .cse455 0) (not (= 0 (select .cse457 .cse458))) (not (= (select .cse459 .cse458) 0)) (= .cse460 0) (= .cse456 0))))))))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2277 Int)) (let ((.cse484 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse487 (select (select .cse484 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse486 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse488 (+ (select (select .cse486 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse485 (select (select .cse484 .cse487) .cse488))) (let ((.cse478 (select .cse486 .cse485)) (.cse477 (+ (select (select .cse486 .cse487) .cse488) 4))) (let ((.cse476 (select .cse484 .cse485)) (.cse472 (store .cse486 .cse485 (store .cse478 .cse477 0)))) (let ((.cse475 (select (select .cse472 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse479 (store .cse484 .cse485 (store .cse476 .cse477 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse482 (select (select .cse479 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse483 (+ .cse475 4))) (let ((.cse480 (select (select .cse479 .cse482) .cse483)) (.cse481 (+ (select (select .cse472 .cse482) .cse483) 4))) (let ((.cse473 (select (select .cse479 .cse480) .cse481)) (.cse474 (+ (select (select .cse472 .cse480) .cse481) 4))) (or (= (select (select .cse472 .cse473) .cse474) .cse475) (not (= 0 (select .cse476 .cse477))) (not (= (select .cse478 .cse477) 0)) (= .cse473 0) (= .cse475 0) (= (select (select .cse479 .cse473) .cse474) 0)))))))))))) (= 0 .cse487))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse502 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse505 (select (select .cse502 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse504 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse506 (+ (select (select .cse504 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse503 (select (select .cse502 .cse505) .cse506))) (let ((.cse497 (select .cse504 .cse503)) (.cse496 (+ (select (select .cse504 .cse505) .cse506) 4))) (let ((.cse495 (select .cse502 .cse503)) (.cse493 (store .cse504 .cse503 (store .cse497 .cse496 0)))) (let ((.cse498 (select (select .cse493 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse489 (store .cse502 .cse503 (store .cse495 .cse496 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse492 (select (select .cse489 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse501 (+ .cse498 4))) (let ((.cse499 (select (select .cse489 .cse492) .cse501)) (.cse500 (+ (select (select .cse493 .cse492) .cse501) 4))) (let ((.cse494 (select (select .cse493 .cse499) .cse500))) (let ((.cse490 (select (select .cse489 .cse499) .cse500)) (.cse491 (+ .cse494 4))) (or (= (select (select .cse489 .cse490) .cse491) .cse492) (= (select (select .cse493 .cse490) .cse491) 0) (= .cse494 0) (not (= 0 (select .cse495 .cse496))) (not (= (select .cse497 .cse496) 0)) (= .cse498 0))))))))))))) (= 0 .cse505))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse523 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse507 (select (select .cse523 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse507) (forall ((v_ArrVal_2277 Int)) (let ((.cse521 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse524 (select (select .cse521 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse525 (+ .cse507 4))) (let ((.cse522 (select (select .cse521 .cse524) .cse525))) (let ((.cse515 (select .cse523 .cse522)) (.cse514 (+ (select (select .cse523 .cse524) .cse525) 4))) (let ((.cse513 (select .cse521 .cse522)) (.cse508 (store .cse523 .cse522 (store .cse515 .cse514 0)))) (let ((.cse511 (select (select .cse508 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse516 (store .cse521 .cse522 (store .cse513 .cse514 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse519 (select (select .cse516 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse520 (+ .cse511 4))) (let ((.cse517 (select (select .cse516 .cse519) .cse520)) (.cse518 (+ (select (select .cse508 .cse519) .cse520) 4))) (let ((.cse512 (select (select .cse508 .cse517) .cse518))) (let ((.cse509 (select (select .cse516 .cse517) .cse518)) (.cse510 (+ .cse512 4))) (or (= (select (select .cse508 .cse509) .cse510) .cse511) (= .cse512 0) (not (= 0 (select .cse513 .cse514))) (not (= (select .cse515 .cse514) 0)) (= .cse511 0) (= (select (select .cse516 .cse509) .cse510) 0))))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2276 Int)) (let ((.cse541 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse526 (select (select .cse541 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse526) (forall ((v_ArrVal_2277 Int)) (let ((.cse539 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse542 (select (select .cse539 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse543 (+ .cse526 4))) (let ((.cse540 (select (select .cse539 .cse542) .cse543))) (let ((.cse533 (select .cse541 .cse540)) (.cse532 (+ (select (select .cse541 .cse542) .cse543) 4))) (let ((.cse531 (select .cse539 .cse540)) (.cse527 (store .cse541 .cse540 (store .cse533 .cse532 0)))) (let ((.cse530 (select (select .cse527 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse534 (store .cse539 .cse540 (store .cse531 .cse532 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse537 (select (select .cse534 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse538 (+ .cse530 4))) (let ((.cse535 (select (select .cse534 .cse537) .cse538)) (.cse536 (+ (select (select .cse527 .cse537) .cse538) 4))) (let ((.cse528 (select (select .cse534 .cse535) .cse536)) (.cse529 (+ (select (select .cse527 .cse535) .cse536) 4))) (or (= (select (select .cse527 .cse528) .cse529) .cse530) (not (= 0 (select .cse531 .cse532))) (not (= (select .cse533 .cse532) 0)) (= .cse528 0) (= .cse530 0) (= (select (select .cse534 .cse528) .cse529) 0)))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2277 Int)) (let ((.cse555 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse558 (select (select .cse555 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse557 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse559 (+ (select (select .cse557 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse556 (select (select .cse555 .cse558) .cse559))) (let ((.cse549 (select .cse555 .cse556)) (.cse551 (select .cse557 .cse556)) (.cse550 (+ (select (select .cse557 .cse558) .cse559) 4))) (let ((.cse548 (store .cse557 .cse556 (store .cse551 .cse550 0))) (.cse544 (store .cse555 .cse556 (store .cse549 .cse550 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse547 (select (select .cse544 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse554 (+ (select (select .cse548 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse552 (select (select .cse544 .cse547) .cse554)) (.cse553 (+ (select (select .cse548 .cse547) .cse554) 4))) (let ((.cse546 (+ (select (select .cse548 .cse552) .cse553) 4)) (.cse545 (select (select .cse544 .cse552) .cse553))) (or (= (select (select .cse544 .cse545) .cse546) .cse547) (= .cse547 0) (= (select (select .cse548 .cse545) .cse546) 0) (not (= 0 (select .cse549 .cse550))) (not (= (select .cse551 .cse550) 0)) (= .cse545 0))))))))))) (= 0 .cse558))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))))) is different from true [2023-02-15 19:51:25,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056341674] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:51:25,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:51:25,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 54 [2023-02-15 19:51:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699351617] [2023-02-15 19:51:25,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:51:25,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 19:51:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:51:25,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 19:51:25,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=4457, Unknown=1, NotChecked=134, Total=4830 [2023-02-15 19:51:25,202 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 54 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 46 states have internal predecessors, (76), 6 states have call successors, (6), 3 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-15 19:51:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:51:36,359 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2023-02-15 19:51:36,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-15 19:51:36,359 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 46 states have internal predecessors, (76), 6 states have call successors, (6), 3 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 46 [2023-02-15 19:51:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:51:36,360 INFO L225 Difference]: With dead ends: 86 [2023-02-15 19:51:36,360 INFO L226 Difference]: Without dead ends: 54 [2023-02-15 19:51:36,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2416 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=916, Invalid=10859, Unknown=1, NotChecked=214, Total=11990 [2023-02-15 19:51:36,363 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 232 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:51:36,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 517 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-15 19:51:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-15 19:51:36,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2023-02-15 19:51:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:51:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2023-02-15 19:51:36,380 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 46 [2023-02-15 19:51:36,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:51:36,380 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2023-02-15 19:51:36,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 46 states have internal predecessors, (76), 6 states have call successors, (6), 3 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-15 19:51:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2023-02-15 19:51:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 19:51:36,381 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:51:36,381 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:51:36,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 19:51:36,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-15 19:51:36,587 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:51:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:51:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2111425896, now seen corresponding path program 3 times [2023-02-15 19:51:36,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:51:36,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457086568] [2023-02-15 19:51:36,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:51:36,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:51:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:36,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:51:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:36,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:51:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:36,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-15 19:51:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:36,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 19:51:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-15 19:51:36,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:51:36,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457086568] [2023-02-15 19:51:36,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457086568] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:51:36,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609470251] [2023-02-15 19:51:36,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:51:36,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:51:36,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:51:36,691 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:51:36,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 19:51:36,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 19:51:36,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:51:36,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 19:51:36,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:51:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 19:51:36,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:51:36,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609470251] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:51:36,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 19:51:36,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-02-15 19:51:36,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800656950] [2023-02-15 19:51:36,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:51:36,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:51:36,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:51:36,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:51:36,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:51:36,981 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 19:51:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:51:37,000 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2023-02-15 19:51:37,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:51:37,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2023-02-15 19:51:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:51:37,001 INFO L225 Difference]: With dead ends: 55 [2023-02-15 19:51:37,001 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 19:51:37,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:51:37,001 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:51:37,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:51:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 19:51:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 19:51:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:51:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 19:51:37,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2023-02-15 19:51:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:51:37,002 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 19:51:37,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 19:51:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 19:51:37,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 19:51:37,004 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 19:51:37,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 19:51:37,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:51:37,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 19:52:12,839 WARN L233 SmtUtils]: Spent 26.45s on a formula simplification. DAG size of input: 614 DAG size of output: 438 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-02-15 19:52:12,842 INFO L899 garLoopResultBuilder]: For program point L605-1(lines 605 607) no Hoare annotation was computed. [2023-02-15 19:52:12,843 INFO L895 garLoopResultBuilder]: At program point L605-3(lines 605 607) the Hoare annotation is: (let ((.cse55 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse22 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse50 (select .cse55 |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse54 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse57 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) (.cse58 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse24 (select .cse58 (+ |ULTIMATE.start_sll_create_#res#1.offset| 4))) (.cse40 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (select .cse54 .cse57)) (.cse11 (select (select |#memory_$Pointer$.base| .cse50) 4)) (.cse2 (select .cse58 4)) (.cse53 (select .cse22 .cse57))) (let ((.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (not (= 0 .cse53))) (.cse3 (< .cse50 |#StackHeapBarrier|)) (.cse4 (= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse5 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse6 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse7 (< .cse2 |#StackHeapBarrier|)) (.cse8 (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) (.cse9 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse10 (= (select (select |#memory_int| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse12 (= (select (select |#memory_int| .cse53) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse13 (= (select (select |#memory_$Pointer$.offset| .cse2) 4) 0)) (.cse14 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse16 (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|))) (.cse17 (< .cse53 |#StackHeapBarrier|)) (.cse18 (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|)) (.cse19 (< |ULTIMATE.start_sll_create_#res#1.base| |#StackHeapBarrier|)) (.cse20 (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse21 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse23 (< .cse11 |#StackHeapBarrier|)) (.cse25 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|) |ULTIMATE.start_main_~data~0#1|)) (.cse26 (= (select (select |#memory_$Pointer$.base| .cse53) (+ .cse30 4)) 0)) (.cse27 (not (= 0 .cse11))) (.cse28 (= (select |#valid| .cse50) 1)) (.cse29 (= (select (select |#memory_$Pointer$.offset| .cse53) 4) 0)) (.cse31 (not (= 0 |ULTIMATE.start_sll_create_#res#1.base|))) (.cse32 (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse11) 1) (= (let ((.cse56 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse56 (select |v_#valid_BEFORE_CALL_30| .cse56))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_30| .cse50) 1) (= 0 (select |v_#valid_BEFORE_CALL_30| |ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| .cse50) 0)))) (.cse33 (or (<= 1 |ULTIMATE.start_sll_create_~head~0#1.base|) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) 0))) (.cse34 (= |ULTIMATE.start_sll_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse35 (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse36 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse37 (= (select |#valid| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (.cse38 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_main_~data~0#1|)) (.cse39 (= (select (select |#memory_$Pointer$.offset| .cse11) 4) 0)) (.cse41 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0)) (.cse42 (= (select (select |#memory_$Pointer$.base| .cse2) 4) 0)) (.cse43 (not (= 0 |ULTIMATE.start_sll_append_~new_last~0#1.base|))) (.cse44 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse45 (= |ULTIMATE.start_sll_append_~data#1| |ULTIMATE.start_main_~data~0#1|)) (.cse46 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|)) (.cse48 (= |ULTIMATE.start_sll_append_~head#1.offset| 0)) (.cse47 (= (select (select |#memory_int| .cse50) .cse40) |ULTIMATE.start_main_~data~0#1|)) (.cse49 (= (select (select |#memory_int| .cse24) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse51 (= 1 (select |#valid| .cse11))) (.cse52 (= (select (select |#memory_int| .cse11) 0) |ULTIMATE.start_main_~data~0#1|))) (or (let ((.cse15 (select |#memory_$Pointer$.offset| .cse50))) (and .cse0 .cse1 (= (select |#valid| .cse2) 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (select (select |#memory_$Pointer$.base| .cse11) 4) 0) .cse12 .cse13 .cse14 (= (select .cse15 4) 0) .cse16 .cse17 .cse18 .cse19 (= .cse11 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse20 .cse21 (= 1 (select |#valid| (select .cse22 4))) .cse23 (not (= 0 .cse24)) .cse25 .cse26 .cse27 .cse28 .cse29 (= .cse30 0) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (= |ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse15 (+ .cse40 4))) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 (= .cse40 0) .cse49 (not (= 0 .cse50)) .cse51 .cse52)) (and .cse0 (= |ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select |#valid| .cse24) 1) .cse1 (not (= 0 .cse2)) (= (select |#valid| .cse53) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) 0) 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= (select .cse54 4) 0) .cse8 (= .cse50 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse9 .cse10 .cse12 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) 4) 0) .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (not (= 0 (select .cse55 0))) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse48 .cse47 .cse49 .cse51 .cse52)))))) [2023-02-15 19:52:12,843 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 609) no Hoare annotation was computed. [2023-02-15 19:52:12,843 INFO L899 garLoopResultBuilder]: For program point L605-4(lines 605 607) no Hoare annotation was computed. [2023-02-15 19:52:12,843 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-02-15 19:52:12,843 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 611 633) the Hoare annotation is: true [2023-02-15 19:52:12,844 INFO L895 garLoopResultBuilder]: At program point L618-2(lines 618 625) the Hoare annotation is: (let ((.cse101 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse107 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse140 (select |#memory_$Pointer$.base| .cse107)) (.cse141 (+ .cse101 4))) (let ((.cse139 (select |#memory_$Pointer$.offset| .cse107)) (.cse86 (select .cse140 .cse141))) (let ((.cse135 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse95 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) (.cse108 (select |#memory_$Pointer$.base| .cse86)) (.cse99 (select .cse139 .cse141)) (.cse49 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) (.cse133 (select .cse140 4))) (let ((.cse58 (select |#valid| .cse133)) (.cse104 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (.cse46 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) .cse49)) (.cse103 (select |#valid| .cse107)) (.cse109 (select .cse139 4)) (.cse137 (select .cse108 (+ .cse99 4))) (.cse94 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse136 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse134 (select .cse135 .cse95)) (.cse132 (select (select |#memory_$Pointer$.base| .cse133) 4)) (.cse138 (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse122 (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse2 (= 0 |ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse39 (= .cse122 1)) (.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse17 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse20 (= 1 .cse138)) (.cse22 (= .cse133 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse25 (= 0 |ULTIMATE.start_sll_append_~last~0#1.offset|)) (.cse5 (= (select (select |#memory_$Pointer$.offset| .cse132) 4) 0)) (.cse52 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~temp~2#1.base|) 4)) (.cse57 (not (= |ULTIMATE.start_sll_append_~head#1.base| .cse107))) (.cse96 (= (select (select |#memory_int| .cse107) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse9 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse98 (or (<= 1 |ULTIMATE.start_sll_create_~head~0#1.base|) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) 0))) (.cse56 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse1 (not (= 0 .cse134))) (.cse3 (not (= 0 .cse136))) (.cse4 (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse107))) (.cse47 (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|)) (.cse6 (= (select |#valid| .cse136) 1)) (.cse7 (= (select |#valid| .cse134) 1)) (.cse59 (< .cse107 |#StackHeapBarrier|)) (.cse8 (= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse48 (= .cse138 1)) (.cse10 (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse136))) (.cse69 (< .cse136 |#StackHeapBarrier|)) (.cse11 (= (select .cse94 4) 0)) (.cse12 (not (= .cse136 |ULTIMATE.start_sll_create_#res#1.base|))) (.cse70 (<= (+ .cse137 2) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse51 (not (= 0 |ULTIMATE.start_main_~ptr~0#1.base|))) (.cse83 (= (select (select |#memory_int| .cse134) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse18 (= .cse109 0)) (.cse19 (not (= 0 |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse85 (< .cse134 |#StackHeapBarrier|)) (.cse21 (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|)) (.cse87 (< |ULTIMATE.start_sll_create_#res#1.base| |#StackHeapBarrier|)) (.cse88 (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse23 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse89 (or (not (<= .cse137 0)) (<= (+ .cse137 1) 0))) (.cse90 (< .cse133 |#StackHeapBarrier|)) (.cse24 (= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse26 (not (= 0 .cse133))) (.cse27 (= .cse103 1)) (.cse54 (not (= 0 |ULTIMATE.start_main_~temp~2#1.base|))) (.cse28 (not (= |ULTIMATE.start_sll_append_~head#1.base| .cse133))) (.cse97 (= (select (select |#memory_int| .cse136) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse29 (not (= |ULTIMATE.start_main_~#s~0#1.base| (select .cse135 4)))) (.cse30 (not (= 0 |ULTIMATE.start_sll_create_#res#1.base|))) (.cse34 (= (select |#valid| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (.cse36 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0)) (.cse37 (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|))) (.cse55 (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse38 (not (= 0 |ULTIMATE.start_sll_append_~new_last~0#1.base|))) (.cse40 (not (= .cse134 |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse100 (= |ULTIMATE.start_sll_append_~data#1| |ULTIMATE.start_main_~data~0#1|)) (.cse41 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|)) (.cse43 (not (= 0 .cse107))) (.cse102 (= (select (select |#memory_int| .cse133) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse31 (= |ULTIMATE.start_sll_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse32 (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse33 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse13 (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) (.cse84 (select (select |#memory_$Pointer$.base| .cse46) 4)) (.cse35 (= (select (select |#memory_$Pointer$.offset| .cse133) 4) 0)) (.cse50 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~temp~2#1.base|) 4) 0)) (.cse14 (= |ULTIMATE.start_main_~temp~2#1.offset| 0)) (.cse15 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse42 (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| .cse104) 4)))) (.cse44 (= 1 .cse58)) (.cse16 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (.cse45 (= (select (select |#memory_$Pointer$.base| .cse132) 4) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~temp~2#1.base| 0) .cse10 (= |ULTIMATE.start_main_~ptr~0#1.base| 0) .cse11 .cse12 .cse13 (not (<= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~len~0#1|)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (<= |ULTIMATE.start_main_~count~0#1| 3) .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 (= .cse46 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse47 .cse6 .cse7 .cse8 .cse48 .cse9 .cse10 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) .cse49) 0) .cse11 .cse12 .cse13 .cse50 .cse14 .cse15 .cse51 .cse16 .cse17 .cse18 .cse19 (= .cse52 0) .cse21 .cse22 .cse23 .cse24 .cse25 (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimIndex_62 Int) (v_arrayElimIndex_61 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse53 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse53 (select |v_#valid_BEFORE_CALL_30| .cse53))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_61) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_62) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_61) 1) (= 0 (select |v_#valid_BEFORE_CALL_30| |ULTIMATE.start_main_~ptr~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| v_arrayElimIndex_62) 0)))) (<= 2 |ULTIMATE.start_main_~count~0#1|) .cse26 .cse27 .cse54 (<= |ULTIMATE.start_main_~count~0#1| 2) .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse55 .cse38 .cse40 .cse39 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse56 .cse1 (= |ULTIMATE.start_main_~count~0#1| 0) .cse3 .cse5 .cse57 .cse6 .cse7 (= .cse58 1) .cse59 .cse8 (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse63 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse65 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse68 (+ .cse63 4))) (let ((.cse61 (select (select |#memory_$Pointer$.offset| .cse65) .cse68))) (let ((.cse64 (select (select |#memory_$Pointer$.base| .cse65) .cse68)) (.cse67 (+ .cse61 4))) (let ((.cse66 (select (select |#memory_$Pointer$.base| .cse64) .cse67))) (and (= (let ((.cse60 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse60 (select |v_#valid_BEFORE_CALL_29| .cse60))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= .cse61 0) (= (let ((.cse62 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse62 (select |v_#valid_BEFORE_CALL_30| .cse62))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse63) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse64) 1) (= .cse63 0) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse65) (<= (+ .cse64 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse66)) (<= (+ .cse66 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse65) 0) (= (select (select |#memory_int| .cse66) 0) |ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_30| .cse65) 1) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= (select (select |#memory_$Pointer$.offset| .cse64) .cse67) 0)))))))) .cse48 .cse9 .cse69 .cse12 .cse13 .cse70 .cse15 (or (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse75 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse74 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse76 (+ .cse75 4))) (let ((.cse72 (select (select |#memory_$Pointer$.base| .cse74) .cse76)) (.cse73 (select |#memory_$Pointer$.offset| .cse74))) (let ((.cse71 (select (select |#memory_$Pointer$.base| .cse72) (+ (select .cse73 .cse76) 4)))) (and (<= (+ .cse71 2) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse72)) (= (select .cse73 4) 0) (not (= 0 .cse74)) (<= (+ .cse71 1) 0) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse74)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse75) (not (= .cse71 .cse72)) (not (= .cse71 .cse74)) (= .cse75 0) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse74))))))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse81 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse80 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse82 (+ .cse81 4))) (let ((.cse78 (select (select |#memory_$Pointer$.base| .cse80) .cse82)) (.cse79 (select |#memory_$Pointer$.offset| .cse80))) (let ((.cse77 (select (select |#memory_$Pointer$.base| .cse78) (+ (select .cse79 .cse82) 4)))) (and (<= (+ .cse77 2) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse78)) (= (select .cse79 4) 0) (not (= 0 .cse80)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse80)) (not (<= .cse77 0)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse81) (not (= .cse77 .cse78)) (not (= .cse77 .cse80)) (= .cse81 0) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse80)))))))) .cse83 .cse51 .cse17 .cse18 (= (select (select |#memory_$Pointer$.base| .cse84) 4) 0) .cse85 (= |ULTIMATE.start_sll_append_~last~0#1.base| .cse86) .cse21 .cse87 .cse88 .cse23 .cse89 .cse90 .cse24 (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse91 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse93 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse92 (select (select |#memory_$Pointer$.base| .cse91) 4))) (and (= (select (select |#memory_$Pointer$.offset| .cse91) 4) 0) (<= (+ .cse92 2) |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse92 .cse91)) (not (= 0 .cse91)) (not (= 0 .cse92)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse93) (<= (+ .cse91 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse93 0) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse91) (= (select (select |#memory_int| .cse92) 0) |ULTIMATE.start_main_~data~0#1|))))) .cse26 .cse27 (= (select .cse94 .cse95) 0) .cse96 .cse97 .cse30 .cse98 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_sll_append_~last~0#1.offset| .cse99) .cse36 .cse55 .cse38 .cse40 .cse39 .cse100 .cse41 (= (select (select |#memory_$Pointer$.offset| .cse84) 4) 0) (= .cse101 0) .cse43 .cse102 .cse45) (and .cse0 .cse17 (<= |ULTIMATE.start_main_~count~0#1| 1) .cse20 .cse22 .cse23 (= (select (select |#memory_$Pointer$.base| .cse52) 4) 0) (= 1 .cse103) .cse25 .cse5 (= (select (select |#memory_$Pointer$.offset| .cse52) 4) 0) (= (select (select |#memory_$Pointer$.offset| .cse104) 4) 0) .cse9 (or (and (exists ((|ULTIMATE.start_main_~#s~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse106 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse105 (select (select |#memory_$Pointer$.base| .cse106) 4))) (and (not (= 0 .cse105)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse106)) (not (= .cse105 .cse106)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse106) (not (= 0 .cse106)))))) .cse21 .cse1 (<= (+ .cse107 2) |ULTIMATE.start_main_~#s~0#1.base|) .cse3 .cse24 (= (select .cse108 (+ .cse109 4)) 0) .cse26 .cse57 .cse6 .cse7 .cse96 .cse28 .cse8 .cse29 .cse9 .cse98 .cse10 .cse34 .cse11 .cse12 .cse36 .cse55 .cse37 .cse38 .cse40 .cse41 .cse51) (and .cse56 .cse1 (or (exists ((v_prenex_2 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse110 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse111 (select (select |#memory_$Pointer$.base| .cse110) 4))) (let ((.cse112 (select (select |#memory_$Pointer$.base| .cse111) 4))) (and (not (= 0 .cse110)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse111)) (not (= (select (select |#memory_$Pointer$.base| v_prenex_2) 0) |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse112 1) 0) (not (= .cse112 .cse110)) (= |ULTIMATE.start_main_~temp~2#1.base| .cse111) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse110)) (not (= .cse112 .cse111)) (<= (+ .cse112 2) |ULTIMATE.start_main_~#s~0#1.base|)))))) (exists ((v_prenex_2 Int)) (let ((.cse113 (select (select |#memory_$Pointer$.base| v_prenex_2) 0))) (let ((.cse115 (select (select |#memory_$Pointer$.base| .cse113) 4))) (let ((.cse114 (select (select |#memory_$Pointer$.base| .cse115) (+ |ULTIMATE.start_main_~temp~2#1.offset| 4)))) (and (not (= 0 .cse113)) (not (= .cse114 .cse115)) (<= (+ .cse114 2) v_prenex_2) (not (<= .cse114 0)) (not (= .cse114 .cse113)) (not (= v_prenex_2 .cse115)) (= |ULTIMATE.start_main_~temp~2#1.base| .cse115) (not (= v_prenex_2 .cse113)))))))) .cse3 .cse4 .cse47 .cse6 .cse7 .cse59 .cse8 .cse48 .cse10 .cse69 .cse11 (= (select (select |#memory_int| |ULTIMATE.start_main_~temp~2#1.base|) 0) |ULTIMATE.start_main_~data~0#1|) .cse12 .cse70 (or (exists ((v_prenex_2 Int)) (let ((.cse117 (select (select |#memory_$Pointer$.base| v_prenex_2) 0))) (let ((.cse118 (select (select |#memory_$Pointer$.base| .cse117) 4))) (let ((.cse116 (select (select |#memory_$Pointer$.base| .cse118) .cse49))) (and (not (<= .cse116 0)) (not (= 0 .cse117)) (<= (+ .cse116 2) v_prenex_2) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse118) (not (= .cse116 .cse118)) (not (= .cse116 .cse117)) (not (= v_prenex_2 .cse118)) (not (= v_prenex_2 .cse117))))))) (exists ((v_prenex_2 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse119 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse120 (select (select |#memory_$Pointer$.base| .cse119) 4))) (let ((.cse121 (select (select |#memory_$Pointer$.base| .cse120) 4))) (and (not (= 0 .cse119)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse120)) (not (= (select (select |#memory_$Pointer$.base| v_prenex_2) 0) |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse121 1) 0) (not (= .cse121 .cse119)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse119)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse120) (not (= .cse121 .cse120)) (<= (+ .cse121 2) |ULTIMATE.start_main_~#s~0#1.base|))))))) .cse51 .cse83 .cse18 .cse19 .cse85 .cse21 .cse87 .cse88 .cse23 .cse89 .cse90 .cse24 .cse26 .cse27 .cse54 .cse28 .cse97 .cse29 .cse30 .cse31 .cse33 .cse34 .cse36 .cse37 .cse55 .cse38 .cse40 .cse100 .cse41 .cse43 .cse102)) .cse31 (= 1 .cse122) .cse32 (= (select (select |#memory_$Pointer$.offset| .cse46) 4) 0) .cse33 .cse13 (= .cse84 0) .cse35 .cse50 .cse14 .cse15 .cse42 (<= 1 |ULTIMATE.start_main_~count~0#1|) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse127 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse129 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse131 (+ .cse127 4))) (let ((.cse124 (select (select |#memory_$Pointer$.offset| .cse129) .cse131))) (let ((.cse126 (select (select |#memory_$Pointer$.base| .cse129) .cse131)) (.cse130 (+ .cse124 4))) (let ((.cse128 (select (select |#memory_$Pointer$.base| .cse126) .cse130))) (and (= (let ((.cse123 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse123 (select |v_#valid_BEFORE_CALL_29| .cse123))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= .cse124 0) (= (let ((.cse125 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse125 (select |v_#valid_BEFORE_CALL_30| .cse125))) |v_#valid_BEFORE_CALL_30|) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse126) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse124) (= (select |v_#valid_BEFORE_CALL_28| .cse126) 1) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse127 0) (<= (+ .cse126 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse128)) (<= (+ .cse128 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse129) 0) (= (select (select |#memory_int| .cse128) 0) |ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_30| .cse129) 1) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= (select (select |#memory_$Pointer$.offset| .cse126) .cse130) 0)))))))) .cse44 .cse16 .cse45)))))))) [2023-02-15 19:52:12,844 INFO L899 garLoopResultBuilder]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2023-02-15 19:52:12,844 INFO L899 garLoopResultBuilder]: For program point L618-3(lines 611 633) no Hoare annotation was computed. [2023-02-15 19:52:12,844 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse16 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse18 (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse19 (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1))) (let ((.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|))) (.cse2 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse3 (or (<= 1 |ULTIMATE.start_sll_create_~head~0#1.base|) (<= .cse19 0))) (.cse4 (= 1 .cse18)) (.cse5 (= 1 (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse7 (<= .cse19 |#StackHeapBarrier|)) (.cse8 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse9 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse10 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_main_~data~0#1|)) (.cse12 (= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|)) (.cse15 (select .cse16 4)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse17 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (or (let ((.cse6 (select .cse16 .cse17))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ .cse6 1) |#StackHeapBarrier|) .cse7 .cse8 .cse9 (not (= 0 .cse6)) .cse10 (= (select .cse11 4) 0) .cse12 (= (select (select |#memory_$Pointer$.base| .cse6) 4) 0) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_28| |#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse13 (select |#valid| .cse13))) |#valid|) (= (select |v_#valid_BEFORE_CALL_28| |ULTIMATE.start_sll_create_~head~0#1.base|) 0))) .cse14 (= (select (select |#memory_$Pointer$.offset| .cse15) 4) 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (= (select (select |#memory_int| .cse6) 0) |ULTIMATE.start_main_~data~0#1|))) (and .cse0 .cse12 .cse1 (= |ULTIMATE.start_sll_create_~len#1| 2) (= .cse18 1) .cse2 .cse14 .cse8 .cse9 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 (= .cse15 0) (= (select .cse11 .cse17) 0) (<= |ULTIMATE.start_sll_create_~len#1| 1) (<= 1 |ULTIMATE.start_sll_create_~len#1|))))) [2023-02-15 19:52:12,844 INFO L899 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2023-02-15 19:52:12,845 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 19:52:12,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 19:52:12,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 631) no Hoare annotation was computed. [2023-02-15 19:52:12,845 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|))) (.cse2 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse4 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|)) (.cse5 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= |ULTIMATE.start_main_~data~0#1| 1))) (or (let ((.cse3 (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1))) (and .cse0 .cse1 .cse2 (or (<= 1 |ULTIMATE.start_sll_create_~head~0#1.base|) (<= .cse3 0)) .cse4 (= 1 (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= .cse3 |#StackHeapBarrier|) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1|) .cse5 .cse6 .cse7 .cse8 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (<= |ULTIMATE.start_sll_create_~len#1| 1) (<= 1 |ULTIMATE.start_sll_create_~len#1|))) (and .cse0 .cse7 .cse1 (= |ULTIMATE.start_sll_create_~len#1| 2) .cse2 .cse4 .cse8 .cse5 .cse6 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)))) [2023-02-15 19:52:12,845 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-02-15 19:52:12,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 19:52:12,845 INFO L899 garLoopResultBuilder]: For program point L599(lines 599 610) no Hoare annotation was computed. [2023-02-15 19:52:12,845 INFO L895 garLoopResultBuilder]: At program point sll_create_returnLabel#1(lines 583 591) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|)) (.cse6 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse6)) (.cse1 (select .cse5 (+ |ULTIMATE.start_sll_create_#res#1.offset| 4))) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse6)) (.cse3 (select .cse5 4))) (and (= |ULTIMATE.start_main_~len~0#1| 2) (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (< .cse0 |#StackHeapBarrier|) (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (< |ULTIMATE.start_sll_create_#res#1.base| |#StackHeapBarrier|) (not (= 0 .cse0)) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= 0 .cse1)) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|) |ULTIMATE.start_main_~data~0#1|) (= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.base| .cse0) (+ .cse2 4)) 0) (= (select (select |#memory_$Pointer$.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_28| |#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse4 (select |#valid| .cse4))) |#valid|) (= (select |v_#valid_BEFORE_CALL_28| |ULTIMATE.start_sll_create_#res#1.base|) 0))) (= (select |#valid| .cse0) 1) (= .cse2 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= (+ .cse3 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= 1 (select |#valid| |ULTIMATE.start_sll_create_#res#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (or (<= 1 |ULTIMATE.start_sll_create_~head~0#1.base|) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_main_~data~0#1|) (or (<= 1 |ULTIMATE.start_sll_create_#res#1.base|) (<= (+ |ULTIMATE.start_sll_create_#res#1.base| 1) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.base| .cse3) 4) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_int| .cse1) 0) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_int| .cse0) 0) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| .cse3) 4) 0)))) [2023-02-15 19:52:12,845 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 622) no Hoare annotation was computed. [2023-02-15 19:52:12,845 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 19:52:12,845 INFO L895 garLoopResultBuilder]: At program point L600(line 600) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|)) (.cse10 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse5 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse10)) (.cse8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select .cse9 (+ |ULTIMATE.start_sll_create_#res#1.offset| 4))) (.cse1 (select .cse3 .cse10)) (.cse7 (select .cse9 4)) (.cse2 (select (select |#memory_$Pointer$.base| .cse0) 4))) (and (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.offset| .cse0) 4) 0) (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (< .cse1 |#StackHeapBarrier|) (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (<= (+ .cse2 1) |#StackHeapBarrier|) (< |ULTIMATE.start_sll_create_#res#1.base| |#StackHeapBarrier|) (not (= 0 .cse1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= 1 (select |#valid| .cse0)) (= 1 (select |#valid| (select .cse3 4))) (not (= 0 .cse4)) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|) |ULTIMATE.start_main_~data~0#1|) (= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.base| .cse1) (+ .cse5 4)) 0) (not (= 0 .cse2)) (= (select (select |#memory_$Pointer$.offset| .cse1) 4) 0) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_28| |#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse6 (select |#valid| .cse6))) |#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 0))) (= (select |#valid| .cse7) 1) (= .cse5 0) (< .cse0 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (or (<= 1 |ULTIMATE.start_sll_create_~head~0#1.base|) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (< .cse7 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| .cse2) 4) 0) (or (<= 1 |ULTIMATE.start_sll_create_#res#1.base|) (<= (+ |ULTIMATE.start_sll_create_#res#1.base| 1) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.base| .cse7) 4) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_append_~data#1| |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_int| .cse0) .cse8) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 4) 0) (= .cse8 0) (= (select (select |#memory_int| .cse4) 0) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_int| .cse1) 0) |ULTIMATE.start_main_~data~0#1|) (not (= 0 .cse0)) (= (select (select |#memory_$Pointer$.offset| .cse7) 4) 0) (= (select (select |#memory_int| .cse2) 0) |ULTIMATE.start_main_~data~0#1|)))) [2023-02-15 19:52:12,846 INFO L899 garLoopResultBuilder]: For program point L600-1(line 600) no Hoare annotation was computed. [2023-02-15 19:52:12,846 INFO L895 garLoopResultBuilder]: At program point main_ERROR#1(lines 611 633) the Hoare annotation is: false [2023-02-15 19:52:12,846 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2023-02-15 19:52:12,846 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-02-15 19:52:12,846 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2023-02-15 19:52:12,846 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2023-02-15 19:52:12,846 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2023-02-15 19:52:12,846 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2023-02-15 19:52:12,846 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-02-15 19:52:12,848 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1] [2023-02-15 19:52:12,849 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 19:52:12,855 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:588) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:348) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:481) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-02-15 19:52:12,857 INFO L158 Benchmark]: Toolchain (without parser) took 165976.15ms. Allocated memory was 155.2MB in the beginning and 480.2MB in the end (delta: 325.1MB). Free memory was 119.7MB in the beginning and 420.0MB in the end (delta: -300.3MB). Peak memory consumption was 297.6MB. Max. memory is 16.1GB. [2023-02-15 19:52:12,857 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 19:52:12,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.81ms. Allocated memory is still 155.2MB. Free memory was 119.7MB in the beginning and 102.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 19:52:12,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.36ms. Allocated memory is still 155.2MB. Free memory was 102.3MB in the beginning and 100.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 19:52:12,858 INFO L158 Benchmark]: Boogie Preprocessor took 20.23ms. Allocated memory is still 155.2MB. Free memory was 100.3MB in the beginning and 98.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 19:52:12,858 INFO L158 Benchmark]: RCFGBuilder took 358.35ms. Allocated memory is still 155.2MB. Free memory was 98.7MB in the beginning and 83.3MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 19:52:12,858 INFO L158 Benchmark]: TraceAbstraction took 165249.12ms. Allocated memory was 155.2MB in the beginning and 480.2MB in the end (delta: 325.1MB). Free memory was 82.5MB in the beginning and 420.0MB in the end (delta: -337.5MB). Peak memory consumption was 259.9MB. Max. memory is 16.1GB. [2023-02-15 19:52:12,859 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.81ms. Allocated memory is still 155.2MB. Free memory was 119.7MB in the beginning and 102.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.36ms. Allocated memory is still 155.2MB. Free memory was 102.3MB in the beginning and 100.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.23ms. Allocated memory is still 155.2MB. Free memory was 100.3MB in the beginning and 98.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 358.35ms. Allocated memory is still 155.2MB. Free memory was 98.7MB in the beginning and 83.3MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 165249.12ms. Allocated memory was 155.2MB in the beginning and 480.2MB in the end (delta: 325.1MB). Free memory was 82.5MB in the beginning and 420.0MB in the end (delta: -337.5MB). Peak memory consumption was 259.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 631]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 165.2s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 35.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 35.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2012 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2008 mSDsluCounter, 4406 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 737 IncrementalHoareTripleChecker+Unchecked, 4049 mSDsCounter, 207 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8594 IncrementalHoareTripleChecker+Invalid, 9538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 207 mSolverCounterUnsat, 357 mSDtfsCounter, 8594 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1343 GetRequests, 517 SyntacticMatches, 30 SemanticMatches, 796 ConstructedPredicates, 52 IntricatePredicates, 0 DeprecatedPredicates, 9538 ImplicationChecksByTransitivity, 75.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=13, InterpolantAutomatonStates: 301, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 108 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 25 PreInvPairs, 44 NumberOfFragments, 6001 HoareAnnotationTreeSize, 25 FomulaSimplifications, 2149 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 11 FomulaSimplificationsInter, 99407 FormulaSimplificationTreeSizeReductionInter, 33.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 87.8s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1224 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1264 ConstructedInterpolants, 68 QuantifiedInterpolants, 34585 SizeOfPredicates, 334 NumberOfNonLiveVariables, 4908 ConjunctsInSsa, 1340 ConjunctsInUnsatCore, 33 InterpolantComputations, 4 PerfectInterpolantSequences, 400/801 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:588) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-02-15 19:52:13,065 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-02-15 19:52:13,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:52:14,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:52:14,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:52:14,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:52:14,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:52:14,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:52:14,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:52:14,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:52:14,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:52:14,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:52:14,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:52:14,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:52:14,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:52:14,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:52:14,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:52:14,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:52:14,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:52:14,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:52:14,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:52:14,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:52:14,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:52:14,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:52:14,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:52:14,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:52:14,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:52:14,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:52:14,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:52:14,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:52:14,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:52:14,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:52:14,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:52:14,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:52:14,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:52:14,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:52:14,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:52:14,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:52:14,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:52:14,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:52:14,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:52:14,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:52:14,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:52:14,691 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-15 19:52:14,716 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:52:14,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:52:14,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:52:14,717 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:52:14,718 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:52:14,718 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:52:14,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:52:14,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:52:14,719 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:52:14,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:52:14,720 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:52:14,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:52:14,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:52:14,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:52:14,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:52:14,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:52:14,721 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 19:52:14,721 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 19:52:14,721 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 19:52:14,721 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:52:14,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:52:14,722 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:52:14,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:52:14,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:52:14,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:52:14,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:52:14,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:52:14,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:52:14,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:52:14,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:52:14,723 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 19:52:14,723 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 19:52:14,723 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:52:14,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:52:14,724 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:52:14,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:52:14,724 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 19:52:14,724 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:52:14,724 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2023-02-15 19:52:14,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:52:15,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:52:15,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:52:15,012 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:52:15,012 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:52:15,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-02-15 19:52:15,973 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:52:16,191 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:52:16,191 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-02-15 19:52:16,213 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10fc79a7a/40b867cc779d485c826cbce6eeb77275/FLAGbdc0a843f [2023-02-15 19:52:16,224 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10fc79a7a/40b867cc779d485c826cbce6eeb77275 [2023-02-15 19:52:16,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:52:16,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:52:16,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:52:16,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:52:16,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:52:16,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:52:16" (1/1) ... [2023-02-15 19:52:16,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dee333e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:52:16, skipping insertion in model container [2023-02-15 19:52:16,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:52:16" (1/1) ... [2023-02-15 19:52:16,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:52:16,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:52:16,514 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/sll2n_append_equal.i[24197,24210] [2023-02-15 19:52:16,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:52:16,531 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:52:16,567 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/sll2n_append_equal.i[24197,24210] [2023-02-15 19:52:16,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:52:16,588 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:52:16,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:52:16 WrapperNode [2023-02-15 19:52:16,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:52:16,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:52:16,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:52:16,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:52:16,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:52:16" (1/1) ... [2023-02-15 19:52:16,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:52:16" (1/1) ... [2023-02-15 19:52:16,636 INFO L138 Inliner]: procedures = 130, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2023-02-15 19:52:16,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:52:16,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:52:16,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:52:16,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:52:16,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:52:16" (1/1) ... [2023-02-15 19:52:16,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:52:16" (1/1) ... [2023-02-15 19:52:16,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:52:16" (1/1) ... [2023-02-15 19:52:16,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:52:16" (1/1) ... [2023-02-15 19:52:16,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:52:16" (1/1) ... [2023-02-15 19:52:16,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:52:16" (1/1) ... [2023-02-15 19:52:16,665 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:52:16" (1/1) ... [2023-02-15 19:52:16,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:52:16" (1/1) ... [2023-02-15 19:52:16,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:52:16,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:52:16,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:52:16,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:52:16,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:52:16" (1/1) ... [2023-02-15 19:52:16,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:52:16,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:52:16,710 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-15 19:52:16,719 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-15 19:52:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 19:52:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 19:52:16,742 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 19:52:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:52:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:52:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 19:52:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:52:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:52:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:52:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 19:52:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 19:52:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 19:52:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:52:16,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:52:16,889 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:52:16,891 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:52:17,076 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:52:17,080 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:52:17,080 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 19:52:17,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:52:17 BoogieIcfgContainer [2023-02-15 19:52:17,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:52:17,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:52:17,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:52:17,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:52:17,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:52:16" (1/3) ... [2023-02-15 19:52:17,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d17ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:52:17, skipping insertion in model container [2023-02-15 19:52:17,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:52:16" (2/3) ... [2023-02-15 19:52:17,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d17ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:52:17, skipping insertion in model container [2023-02-15 19:52:17,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:52:17" (3/3) ... [2023-02-15 19:52:17,086 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-02-15 19:52:17,097 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:52:17,097 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:52:17,124 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:52:17,128 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;@4020e1b0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:52:17,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:52:17,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 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-15 19:52:17,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 19:52:17,136 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:52:17,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:52:17,137 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:52:17,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:52:17,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2128592868, now seen corresponding path program 1 times [2023-02-15 19:52:17,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:52:17,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713694332] [2023-02-15 19:52:17,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:17,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:17,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:52:17,156 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:52:17,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 19:52:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:17,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 19:52:17,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:52:17,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:52:17,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:52:17,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713694332] [2023-02-15 19:52:17,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713694332] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:52:17,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:52:17,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 19:52:17,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917023081] [2023-02-15 19:52:17,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:52:17,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 19:52:17,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:52:17,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 19:52:17,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:52:17,314 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:52:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:52:17,333 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2023-02-15 19:52:17,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 19:52:17,335 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-15 19:52:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:52:17,339 INFO L225 Difference]: With dead ends: 56 [2023-02-15 19:52:17,339 INFO L226 Difference]: Without dead ends: 25 [2023-02-15 19:52:17,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:52:17,343 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:52:17,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:52:17,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-15 19:52:17,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-15 19:52:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-15 19:52:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-02-15 19:52:17,368 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2023-02-15 19:52:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:52:17,368 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-02-15 19:52:17,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:52:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-02-15 19:52:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 19:52:17,369 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:52:17,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:52:17,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-15 19:52:17,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:17,578 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:52:17,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:52:17,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1341887012, now seen corresponding path program 1 times [2023-02-15 19:52:17,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:52:17,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708748121] [2023-02-15 19:52:17,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:17,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:17,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:52:17,582 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:52:17,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 19:52:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:17,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 19:52:17,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:52:17,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:52:17,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:52:17,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708748121] [2023-02-15 19:52:17,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708748121] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:52:17,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:52:17,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:52:17,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135809331] [2023-02-15 19:52:17,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:52:17,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:52:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:52:17,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:52:17,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:52:17,751 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:52:17,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:52:17,759 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2023-02-15 19:52:17,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:52:17,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-15 19:52:17,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:52:17,760 INFO L225 Difference]: With dead ends: 48 [2023-02-15 19:52:17,760 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 19:52:17,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-15 19:52:17,761 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:52:17,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 55 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:52:17,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 19:52:17,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-02-15 19:52:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-15 19:52:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-02-15 19:52:17,765 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2023-02-15 19:52:17,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:52:17,766 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-02-15 19:52:17,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:52:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-02-15 19:52:17,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 19:52:17,766 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:52:17,766 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, 1, 1] [2023-02-15 19:52:17,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 19:52:17,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:17,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:52:17,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:52:17,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2097266908, now seen corresponding path program 1 times [2023-02-15 19:52:17,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:52:17,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480562478] [2023-02-15 19:52:17,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:17,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:17,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:52:17,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:52:17,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 19:52:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:18,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 19:52:18,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:52:18,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:52:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:52:18,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:52:18,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480562478] [2023-02-15 19:52:18,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480562478] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:52:18,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:52:18,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-15 19:52:18,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937910446] [2023-02-15 19:52:18,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:52:18,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:52:18,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:52:18,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:52:18,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:52:18,158 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 19:52:18,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:52:18,193 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-02-15 19:52:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:52:18,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-02-15 19:52:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:52:18,195 INFO L225 Difference]: With dead ends: 52 [2023-02-15 19:52:18,195 INFO L226 Difference]: Without dead ends: 33 [2023-02-15 19:52:18,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:52:18,198 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:52:18,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 84 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:52:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-15 19:52:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2023-02-15 19:52:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-15 19:52:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-15 19:52:18,209 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2023-02-15 19:52:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:52:18,210 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-15 19:52:18,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 19:52:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-15 19:52:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 19:52:18,211 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:52:18,212 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:52:18,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 19:52:18,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:18,421 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:52:18,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:52:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash -867054116, now seen corresponding path program 2 times [2023-02-15 19:52:18,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:52:18,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984071988] [2023-02-15 19:52:18,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:52:18,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:18,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:52:18,426 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:52:18,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 19:52:18,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 19:52:18,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:52:18,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 19:52:18,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:18,606 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-15 19:52:18,620 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-15 19:52:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 19:52:18,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:52:18,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:52:18,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984071988] [2023-02-15 19:52:18,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984071988] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:52:18,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:52:18,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 19:52:18,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602988288] [2023-02-15 19:52:18,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:52:18,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 19:52:18,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:52:18,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 19:52:18,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 19:52:18,630 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:52:18,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:52:18,764 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2023-02-15 19:52:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:52:18,767 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2023-02-15 19:52:18,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:52:18,767 INFO L225 Difference]: With dead ends: 43 [2023-02-15 19:52:18,767 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 19:52:18,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:52:18,768 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:52:18,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 115 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:52:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 19:52:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2023-02-15 19:52:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-15 19:52:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-02-15 19:52:18,772 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 35 [2023-02-15 19:52:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:52:18,772 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-02-15 19:52:18,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:52:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-02-15 19:52:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 19:52:18,773 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:52:18,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:52:18,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 19:52:18,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:18,974 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:52:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:52:18,974 INFO L85 PathProgramCache]: Analyzing trace with hash -867052442, now seen corresponding path program 1 times [2023-02-15 19:52:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:52:18,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991024415] [2023-02-15 19:52:18,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:18,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:18,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:52:18,978 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:52:18,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 19:52:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:19,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 19:52:19,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:19,218 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 6 treesize of output 5 [2023-02-15 19:52:19,288 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-15 19:52:19,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:19,403 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-15 19:52:19,453 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-15 19:52:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:52:19,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:52:19,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:52:19,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991024415] [2023-02-15 19:52:19,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991024415] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:52:19,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1601682367] [2023-02-15 19:52:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:19,547 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 19:52:19,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 19:52:19,549 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 19:52:19,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-02-15 19:52:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:19,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 19:52:19,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:19,958 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-15 19:52:20,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:20,015 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-15 19:52:20,078 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-15 19:52:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:52:20,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:52:20,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1601682367] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:52:20,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:52:20,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2023-02-15 19:52:20,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449202064] [2023-02-15 19:52:20,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:52:20,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 19:52:20,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:52:20,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 19:52:20,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=425, Unknown=1, NotChecked=0, Total=506 [2023-02-15 19:52:20,139 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 21 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:52:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:52:20,837 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2023-02-15 19:52:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 19:52:20,838 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2023-02-15 19:52:20,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:52:20,839 INFO L225 Difference]: With dead ends: 37 [2023-02-15 19:52:20,839 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 19:52:20,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=708, Unknown=2, NotChecked=0, Total=870 [2023-02-15 19:52:20,840 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 61 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:52:20,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 159 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 6 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 19:52:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 19:52:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-15 19:52:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 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-15 19:52:20,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-02-15 19:52:20,844 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 35 [2023-02-15 19:52:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:52:20,856 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-02-15 19:52:20,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:52:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-02-15 19:52:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 19:52:20,859 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:52:20,860 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:52:20,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-02-15 19:52:21,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 19:52:21,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:21,263 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:52:21,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:52:21,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1386356248, now seen corresponding path program 1 times [2023-02-15 19:52:21,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:52:21,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879798309] [2023-02-15 19:52:21,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:21,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:21,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:52:21,265 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:52:21,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 19:52:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:21,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-15 19:52:21,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:21,621 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 13 treesize of output 9 [2023-02-15 19:52:21,627 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 6 treesize of output 5 [2023-02-15 19:52:21,769 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:52:21,769 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 21 treesize of output 24 [2023-02-15 19:52:21,774 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-15 19:52:21,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:21,929 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 19:52:21,929 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 27 treesize of output 37 [2023-02-15 19:52:21,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:21,941 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-15 19:52:22,104 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-15 19:52:22,330 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:52:22,331 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 32 [2023-02-15 19:52:22,376 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 23 treesize of output 11 [2023-02-15 19:52:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:52:22,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:52:22,470 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2023-02-15 19:52:22,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:52:22,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879798309] [2023-02-15 19:52:22,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879798309] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:52:22,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [38492647] [2023-02-15 19:52:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:22,856 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 19:52:22,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 19:52:22,857 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 19:52:22,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-02-15 19:52:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:23,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 19:52:23,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:23,522 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 19:52:23,523 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 49 [2023-02-15 19:52:23,541 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 19:52:23,541 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 1 case distinctions, treesize of input 20 treesize of output 26 [2023-02-15 19:52:23,550 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:52:23,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:52:23,659 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 1 case distinctions, treesize of input 40 treesize of output 39 [2023-02-15 19:52:23,663 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 26 treesize of output 18 [2023-02-15 19:52:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 19:52:23,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:52:23,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [38492647] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:52:23,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 19:52:23,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [23] total 32 [2023-02-15 19:52:23,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904779589] [2023-02-15 19:52:23,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:52:23,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 19:52:23,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:52:23,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 19:52:23,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1273, Unknown=8, NotChecked=72, Total=1482 [2023-02-15 19:52:23,725 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:52:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:52:24,091 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2023-02-15 19:52:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 19:52:24,092 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-02-15 19:52:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:52:24,092 INFO L225 Difference]: With dead ends: 47 [2023-02-15 19:52:24,092 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 19:52:24,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=156, Invalid=1646, Unknown=8, NotChecked=82, Total=1892 [2023-02-15 19:52:24,093 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:52:24,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 120 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:52:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 19:52:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2023-02-15 19:52:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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-15 19:52:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-02-15 19:52:24,099 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 38 [2023-02-15 19:52:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:52:24,099 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-02-15 19:52:24,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:52:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-02-15 19:52:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 19:52:24,100 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:52:24,100 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:52:24,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-02-15 19:52:24,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 19:52:24,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:24,504 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:52:24,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:52:24,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1386357922, now seen corresponding path program 1 times [2023-02-15 19:52:24,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:52:24,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959145688] [2023-02-15 19:52:24,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:24,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:24,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:52:24,507 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:52:24,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 19:52:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:24,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-15 19:52:24,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:24,772 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 7 [2023-02-15 19:52:24,863 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 13 treesize of output 9 [2023-02-15 19:52:24,868 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 6 treesize of output 5 [2023-02-15 19:52:25,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:52:25,037 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 30 treesize of output 33 [2023-02-15 19:52:25,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 26 treesize of output 18 [2023-02-15 19:52:25,055 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 7 treesize of output 5 [2023-02-15 19:52:25,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:25,213 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:52:25,213 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 36 treesize of output 42 [2023-02-15 19:52:25,226 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-02-15 19:52:25,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-02-15 19:52:25,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:25,234 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 32 treesize of output 32 [2023-02-15 19:52:25,305 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 33 treesize of output 21 [2023-02-15 19:52:25,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:52:25,359 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 32 treesize of output 27 [2023-02-15 19:52:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:52:25,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:52:25,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:52:25,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959145688] [2023-02-15 19:52:25,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959145688] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:52:25,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2097381482] [2023-02-15 19:52:25,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:25,589 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 19:52:25,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 19:52:25,590 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 19:52:25,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-02-15 19:52:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:25,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-15 19:52:25,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:26,032 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 7 [2023-02-15 19:52:26,194 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 13 treesize of output 9 [2023-02-15 19:52:26,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:52:26,418 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 1 case distinctions, treesize of input 24 treesize of output 15 [2023-02-15 19:52:26,422 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-15 19:52:26,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:26,553 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-15 19:52:26,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:26,573 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:52:26,573 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 30 treesize of output 36 [2023-02-15 19:52:26,596 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-02-15 19:52:26,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-02-15 19:52:26,699 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-15 19:52:26,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:52:26,804 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 1 case distinctions, treesize of input 32 treesize of output 15 [2023-02-15 19:52:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:52:26,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:52:26,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2097381482] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:52:26,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:52:26,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2023-02-15 19:52:26,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789242959] [2023-02-15 19:52:26,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:52:26,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 19:52:26,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:52:26,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 19:52:26,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1317, Unknown=7, NotChecked=0, Total=1482 [2023-02-15 19:52:26,957 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 36 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 28 states have internal predecessors, (55), 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-15 19:52:28,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:52:28,567 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2023-02-15 19:52:28,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 19:52:28,568 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 28 states have internal predecessors, (55), 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 38 [2023-02-15 19:52:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:52:28,572 INFO L225 Difference]: With dead ends: 41 [2023-02-15 19:52:28,572 INFO L226 Difference]: Without dead ends: 33 [2023-02-15 19:52:28,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=327, Invalid=2212, Unknown=11, NotChecked=0, Total=2550 [2023-02-15 19:52:28,574 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 80 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 13 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 19:52:28,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 301 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 440 Invalid, 17 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 19:52:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-15 19:52:28,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-02-15 19:52:28,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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-15 19:52:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-02-15 19:52:28,586 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 38 [2023-02-15 19:52:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:52:28,586 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-02-15 19:52:28,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 28 states have internal predecessors, (55), 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-15 19:52:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-02-15 19:52:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 19:52:28,589 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:52:28,589 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:52:28,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2023-02-15 19:52:28,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 19:52:28,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:28,993 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:52:28,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:52:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash 403579891, now seen corresponding path program 1 times [2023-02-15 19:52:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:52:28,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775340298] [2023-02-15 19:52:28,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:28,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:28,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:52:28,995 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:52:28,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 19:52:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:29,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-15 19:52:29,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:29,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-02-15 19:52:29,323 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 6 treesize of output 5 [2023-02-15 19:52:29,327 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-15 19:52:29,464 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 31 treesize of output 19 [2023-02-15 19:52:29,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2023-02-15 19:52:29,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:52:29,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:52:29,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:29,602 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 37 treesize of output 35 [2023-02-15 19:52:29,620 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-02-15 19:52:29,620 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 1 case distinctions, treesize of input 17 treesize of output 17 [2023-02-15 19:52:29,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:29,633 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:52:29,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 19:52:29,823 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-02-15 19:52:29,823 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 18 [2023-02-15 19:52:29,903 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 28 treesize of output 23 [2023-02-15 19:52:29,952 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 24 treesize of output 12 [2023-02-15 19:52:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:52:29,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:52:30,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:52:30,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775340298] [2023-02-15 19:52:30,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775340298] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:52:30,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1945917606] [2023-02-15 19:52:30,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:30,480 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 19:52:30,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 19:52:30,481 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 19:52:30,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-02-15 19:52:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:30,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-15 19:52:30,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:30,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-02-15 19:52:31,172 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-15 19:52:31,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:52:31,498 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 1 case distinctions, treesize of input 31 treesize of output 18 [2023-02-15 19:52:31,501 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-15 19:52:31,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:31,652 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:52:31,652 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 37 treesize of output 41 [2023-02-15 19:52:31,670 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-02-15 19:52:31,670 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 1 case distinctions, treesize of input 17 treesize of output 17 [2023-02-15 19:52:31,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:31,696 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 14 treesize of output 16 [2023-02-15 19:52:31,877 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-15 19:52:32,161 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 19:52:32,161 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 42 treesize of output 47 [2023-02-15 19:52:32,173 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 15 treesize of output 11 [2023-02-15 19:52:32,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:52:32,461 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 1 case distinctions, treesize of input 65 treesize of output 40 [2023-02-15 19:52:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:52:32,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:52:32,619 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))) v_ArrVal_651) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:52:32,630 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32))) v_ArrVal_651) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:52:32,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1945917606] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:52:32,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:52:32,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 38 [2023-02-15 19:52:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946884729] [2023-02-15 19:52:32,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:52:32,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 19:52:32,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:52:32,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 19:52:32,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1769, Unknown=26, NotChecked=174, Total=2162 [2023-02-15 19:52:32,834 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 19:52:35,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:52:35,474 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-02-15 19:52:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 19:52:35,475 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2023-02-15 19:52:35,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:52:35,475 INFO L225 Difference]: With dead ends: 50 [2023-02-15 19:52:35,475 INFO L226 Difference]: Without dead ends: 47 [2023-02-15 19:52:35,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=387, Invalid=3013, Unknown=30, NotChecked=230, Total=3660 [2023-02-15 19:52:35,477 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 163 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 18 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:52:35,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 332 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 560 Invalid, 17 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 19:52:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-15 19:52:35,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2023-02-15 19:52:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-15 19:52:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-02-15 19:52:35,484 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 40 [2023-02-15 19:52:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:52:35,484 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-02-15 19:52:35,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 19:52:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2023-02-15 19:52:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 19:52:35,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:52:35,485 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:52:35,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2023-02-15 19:52:35,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 19:52:35,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:35,889 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:52:35,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:52:35,889 INFO L85 PathProgramCache]: Analyzing trace with hash 403581565, now seen corresponding path program 1 times [2023-02-15 19:52:35,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:52:35,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451593527] [2023-02-15 19:52:35,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:35,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:35,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:52:35,891 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:52:35,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 19:52:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:36,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-15 19:52:36,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:36,121 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 7 [2023-02-15 19:52:36,145 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 7 treesize of output 5 [2023-02-15 19:52:36,213 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 19:52:36,213 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 19 treesize of output 27 [2023-02-15 19:52:36,312 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 15 treesize of output 11 [2023-02-15 19:52:36,358 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-15 19:52:36,432 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-15 19:52:36,432 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 26 treesize of output 43 [2023-02-15 19:52:36,507 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-15 19:52:36,519 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 6 treesize of output 5 [2023-02-15 19:52:36,527 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-15 19:52:36,829 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:52:36,830 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 74 treesize of output 37 [2023-02-15 19:52:36,837 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-15 19:52:36,843 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 22 treesize of output 16 [2023-02-15 19:52:36,848 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-15 19:52:37,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:37,027 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:52:37,028 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 80 treesize of output 68 [2023-02-15 19:52:37,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:37,043 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-15 19:52:37,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:37,076 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-02-15 19:52:37,076 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 39 treesize of output 39 [2023-02-15 19:52:37,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:37,089 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-15 19:52:37,655 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 19:52:37,656 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 128 treesize of output 101 [2023-02-15 19:52:37,688 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:52:37,688 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 48 treesize of output 49 [2023-02-15 19:52:37,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:37,694 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 32 treesize of output 34 [2023-02-15 19:52:37,796 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:52:37,796 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 75 treesize of output 34 [2023-02-15 19:52:37,803 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-15 19:52:37,883 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-15 19:52:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:52:37,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:52:38,050 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_729) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:52:38,073 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_729) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_728) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 19:52:38,089 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_729) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_728) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 19:52:38,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:52:38,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451593527] [2023-02-15 19:52:38,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451593527] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:52:38,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1144302462] [2023-02-15 19:52:38,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:38,358 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 19:52:38,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 19:52:38,359 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 19:52:38,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-02-15 19:52:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:38,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 68 conjunts are in the unsatisfiable core [2023-02-15 19:52:38,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:38,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 7 [2023-02-15 19:52:39,057 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 7 treesize of output 5 [2023-02-15 19:52:39,212 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-15 19:52:39,330 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 19:52:39,330 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 19 treesize of output 27 [2023-02-15 19:52:39,448 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 19 treesize of output 18 [2023-02-15 19:52:39,458 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-15 19:52:39,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:52:39,875 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 1 case distinctions, treesize of input 65 treesize of output 32 [2023-02-15 19:52:39,879 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 15 treesize of output 11 [2023-02-15 19:52:39,882 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-15 19:52:39,887 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-15 19:52:40,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:40,096 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:52:40,097 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 71 treesize of output 61 [2023-02-15 19:52:40,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:40,106 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-15 19:52:40,133 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-02-15 19:52:40,133 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 32 treesize of output 34 [2023-02-15 19:52:40,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:40,142 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-15 19:52:40,874 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 19:52:40,874 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 119 treesize of output 94 [2023-02-15 19:52:40,905 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 19:52:40,905 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 48 treesize of output 53 [2023-02-15 19:52:40,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:40,912 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-15 19:52:40,917 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 21 treesize of output 17 [2023-02-15 19:52:41,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:52:41,177 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 1 case distinctions, treesize of input 66 treesize of output 29 [2023-02-15 19:52:41,184 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-15 19:52:41,265 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-15 19:52:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:52:41,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:52:41,281 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_809) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_810) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_811) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:52:41,301 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_809) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_810) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_811) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 19:52:41,320 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_809) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_810) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_811) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 19:52:41,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1144302462] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:52:41,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:52:41,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2023-02-15 19:52:41,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889184783] [2023-02-15 19:52:41,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:52:41,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 19:52:41,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:52:41,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 19:52:41,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1904, Unknown=24, NotChecked=558, Total=2652 [2023-02-15 19:52:41,969 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 41 states, 39 states have (on average 1.564102564102564) internal successors, (61), 32 states have internal predecessors, (61), 6 states have call successors, (6), 5 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-15 19:52:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:52:48,543 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2023-02-15 19:52:48,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 19:52:48,544 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.564102564102564) internal successors, (61), 32 states have internal predecessors, (61), 6 states have call successors, (6), 5 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-15 19:52:48,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:52:48,545 INFO L225 Difference]: With dead ends: 48 [2023-02-15 19:52:48,545 INFO L226 Difference]: Without dead ends: 46 [2023-02-15 19:52:48,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=435, Invalid=3346, Unknown=25, NotChecked=750, Total=4556 [2023-02-15 19:52:48,546 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 255 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 30 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:52:48,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 289 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 713 Invalid, 5 Unknown, 0 Unchecked, 2.5s Time] [2023-02-15 19:52:48,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-15 19:52:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2023-02-15 19:52:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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-15 19:52:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-02-15 19:52:48,556 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 40 [2023-02-15 19:52:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:52:48,556 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-02-15 19:52:48,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.564102564102564) internal successors, (61), 32 states have internal predecessors, (61), 6 states have call successors, (6), 5 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-15 19:52:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-02-15 19:52:48,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 19:52:48,557 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:52:48,557 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:52:48,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2023-02-15 19:52:48,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 19:52:48,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:48,961 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:52:48,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:52:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1294860110, now seen corresponding path program 1 times [2023-02-15 19:52:48,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:52:48,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609545125] [2023-02-15 19:52:48,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:48,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:52:48,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:52:48,963 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:52:48,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 19:52:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:49,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 68 conjunts are in the unsatisfiable core [2023-02-15 19:52:49,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:49,177 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 7 [2023-02-15 19:52:49,192 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 7 treesize of output 5 [2023-02-15 19:52:49,277 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 19:52:49,277 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 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 19:52:49,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-02-15 19:52:49,472 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-15 19:52:49,481 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-15 19:52:49,686 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 19:52:49,686 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 55 treesize of output 39 [2023-02-15 19:52:49,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2023-02-15 19:52:49,699 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:52:49,699 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 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:52:49,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:49,886 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:52:49,886 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 61 treesize of output 57 [2023-02-15 19:52:49,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:49,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:49,903 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:52:49,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 19:52:49,933 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-02-15 19:52:49,934 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 1 case distinctions, treesize of input 17 treesize of output 17 [2023-02-15 19:52:50,500 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-15 19:52:50,501 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 5 case distinctions, treesize of input 129 treesize of output 102 [2023-02-15 19:52:50,531 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2023-02-15 19:52:50,531 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 3 case distinctions, treesize of input 82 treesize of output 78 [2023-02-15 19:52:50,536 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 21 treesize of output 3 [2023-02-15 19:52:50,629 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 19:52:50,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 48 treesize of output 28 [2023-02-15 19:52:50,739 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 19:52:50,739 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 68 treesize of output 36 [2023-02-15 19:52:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:52:50,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:52:51,013 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_887))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) is different from false [2023-02-15 19:52:51,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:52:51,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609545125] [2023-02-15 19:52:51,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609545125] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:52:51,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [196369501] [2023-02-15 19:52:51,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:52:51,836 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 19:52:51,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 19:52:51,837 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 19:52:51,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-02-15 19:52:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:52:52,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 19:52:52,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:52:52,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-02-15 19:52:52,809 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 19:52:52,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 19:52:52,948 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 13 treesize of output 9 [2023-02-15 19:52:53,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:52:53,465 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 1 case distinctions, treesize of input 70 treesize of output 33 [2023-02-15 19:52:53,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-15 19:52:53,476 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-15 19:52:53,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:53,938 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-15 19:52:53,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:53,964 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:52:53,964 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 76 treesize of output 64 [2023-02-15 19:52:53,989 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-02-15 19:52:53,989 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 2 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 19:52:55,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:52:55,315 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:52:55,382 INFO L321 Elim1Store]: treesize reduction 128, result has 21.5 percent of original size [2023-02-15 19:52:55,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 169 treesize of output 89 [2023-02-15 19:52:55,406 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 19:52:55,406 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 132 treesize of output 100 [2023-02-15 19:52:55,636 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-15 19:52:55,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:52:55,850 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 1 case distinctions, treesize of input 75 treesize of output 30 [2023-02-15 19:52:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:52:55,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:53:34,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [196369501] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:53:34,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:53:34,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 48 [2023-02-15 19:53:34,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873529800] [2023-02-15 19:53:34,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:53:34,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-15 19:53:34,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:53:34,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-15 19:53:34,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=3348, Unknown=50, NotChecked=118, Total=3782 [2023-02-15 19:53:34,026 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 48 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 40 states have internal predecessors, (67), 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)