./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:30:23,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:30:23,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:30:23,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:30:23,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:30:23,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:30:23,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:30:23,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:30:23,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:30:23,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:30:23,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:30:23,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:30:23,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:30:23,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:30:23,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:30:23,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:30:23,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:30:23,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:30:23,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:30:23,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:30:23,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:30:23,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:30:23,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:30:23,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:30:23,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:30:23,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:30:23,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:30:23,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:30:23,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:30:23,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:30:23,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:30:23,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:30:23,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:30:23,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:30:23,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:30:23,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:30:23,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:30:23,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:30:23,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:30:23,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:30:23,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:30:23,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:30:23,571 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:30:23,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:30:23,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:30:23,572 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:30:23,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:30:23,573 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:30:23,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:30:23,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:30:23,574 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:30:23,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:30:23,575 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:30:23,576 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:30:23,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:30:23,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:30:23,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:30:23,576 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:30:23,577 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:30:23,577 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:30:23,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:30:23,577 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:30:23,577 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:30:23,578 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:30:23,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:30:23,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:30:23,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:30:23,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:30:23,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:30:23,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:30:23,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:30:23,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:30:23,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:30:23,580 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:30:23,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:30:23,581 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:30:23,581 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2023-02-15 13:30:23,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:30:23,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:30:23,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:30:23,846 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:30:23,846 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:30:23,847 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-02-15 13:30:25,042 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:30:25,245 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:30:25,247 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-02-15 13:30:25,256 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12028389f/f9a163a1b79f4546ba4a4773bcb72f1a/FLAG2363bb928 [2023-02-15 13:30:25,271 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12028389f/f9a163a1b79f4546ba4a4773bcb72f1a [2023-02-15 13:30:25,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:30:25,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:30:25,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:30:25,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:30:25,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:30:25,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:30:25" (1/1) ... [2023-02-15 13:30:25,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ae6696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:25, skipping insertion in model container [2023-02-15 13:30:25,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:30:25" (1/1) ... [2023-02-15 13:30:25,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:30:25,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:30:25,597 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-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-02-15 13:30:25,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:30:25,607 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:30:25,638 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-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-02-15 13:30:25,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:30:25,668 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:30:25,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:25 WrapperNode [2023-02-15 13:30:25,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:30:25,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:30:25,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:30:25,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:30:25,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:25" (1/1) ... [2023-02-15 13:30:25,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:25" (1/1) ... [2023-02-15 13:30:25,715 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2023-02-15 13:30:25,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:30:25,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:30:25,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:30:25,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:30:25,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:25" (1/1) ... [2023-02-15 13:30:25,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:25" (1/1) ... [2023-02-15 13:30:25,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:25" (1/1) ... [2023-02-15 13:30:25,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:25" (1/1) ... [2023-02-15 13:30:25,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:25" (1/1) ... [2023-02-15 13:30:25,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:25" (1/1) ... [2023-02-15 13:30:25,738 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:25" (1/1) ... [2023-02-15 13:30:25,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:25" (1/1) ... [2023-02-15 13:30:25,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:30:25,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:30:25,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:30:25,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:30:25,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:25" (1/1) ... [2023-02-15 13:30:25,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:30:25,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:30:25,773 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 13:30:25,774 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 13:30:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 13:30:25,808 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 13:30:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:30:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:30:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:30:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:30:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:30:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:30:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:30:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:30:25,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:30:25,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:30:25,955 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:30:25,959 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:30:26,001 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 13:30:26,189 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:30:26,196 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:30:26,196 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 13:30:26,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:30:26 BoogieIcfgContainer [2023-02-15 13:30:26,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:30:26,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:30:26,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:30:26,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:30:26,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:30:25" (1/3) ... [2023-02-15 13:30:26,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b94ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:30:26, skipping insertion in model container [2023-02-15 13:30:26,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:25" (2/3) ... [2023-02-15 13:30:26,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b94ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:30:26, skipping insertion in model container [2023-02-15 13:30:26,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:30:26" (3/3) ... [2023-02-15 13:30:26,240 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-02-15 13:30:26,254 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:30:26,255 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-02-15 13:30:26,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:30:26,314 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@3936f7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:30:26,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-02-15 13:30:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 39 states have (on average 2.0) internal successors, (78), 68 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:30:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 13:30:26,322 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:26,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 13:30:26,324 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:30:26,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:26,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2023-02-15 13:30:26,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:26,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011314996] [2023-02-15 13:30:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:26,565 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 13:30:26,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:26,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011314996] [2023-02-15 13:30:26,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011314996] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:26,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:26,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:30:26,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608373495] [2023-02-15 13:30:26,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:26,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:30:26,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:26,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:30:26,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:26,619 INFO L87 Difference]: Start difference. First operand has 70 states, 39 states have (on average 2.0) internal successors, (78), 68 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 13:30:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:26,738 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2023-02-15 13:30:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:30:26,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-15 13:30:26,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:26,749 INFO L225 Difference]: With dead ends: 92 [2023-02-15 13:30:26,749 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 13:30:26,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:30:26,756 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 60 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:26,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 67 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:26,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 13:30:26,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 61. [2023-02-15 13:30:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 60 states have internal predecessors, (65), 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 13:30:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2023-02-15 13:30:26,796 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 4 [2023-02-15 13:30:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:26,797 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2023-02-15 13:30:26,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 13:30:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2023-02-15 13:30:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 13:30:26,798 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:26,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 13:30:26,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:30:26,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:30:26,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2023-02-15 13:30:26,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:26,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908238240] [2023-02-15 13:30:26,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:26,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:26,925 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 13:30:26,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:26,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908238240] [2023-02-15 13:30:26,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908238240] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:26,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:26,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:30:26,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253370406] [2023-02-15 13:30:26,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:26,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:30:26,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:26,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:30:26,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:26,929 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 13:30:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:26,964 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2023-02-15 13:30:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:30:26,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-15 13:30:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:26,965 INFO L225 Difference]: With dead ends: 58 [2023-02-15 13:30:26,965 INFO L226 Difference]: Without dead ends: 58 [2023-02-15 13:30:26,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:30:26,967 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:26,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 42 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:30:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-15 13:30:26,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-15 13:30:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:30:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2023-02-15 13:30:26,973 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 4 [2023-02-15 13:30:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:26,973 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2023-02-15 13:30:26,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 13:30:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2023-02-15 13:30:26,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:30:26,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:26,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:26,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:30:26,975 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:30:26,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:26,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2023-02-15 13:30:26,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:26,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481953726] [2023-02-15 13:30:26,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:26,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:27,095 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 13:30:27,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:27,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481953726] [2023-02-15 13:30:27,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481953726] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:27,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:27,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:30:27,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519937631] [2023-02-15 13:30:27,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:27,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:30:27,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:27,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:30:27,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:27,099 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 13:30:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:27,177 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2023-02-15 13:30:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:30:27,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 13:30:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:27,179 INFO L225 Difference]: With dead ends: 98 [2023-02-15 13:30:27,181 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 13:30:27,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:30:27,183 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:27,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 118 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 13:30:27,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2023-02-15 13:30:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 55 states have internal predecessors, (60), 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 13:30:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2023-02-15 13:30:27,197 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 9 [2023-02-15 13:30:27,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:27,197 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2023-02-15 13:30:27,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 13:30:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2023-02-15 13:30:27,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:30:27,198 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:27,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:27,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:30:27,199 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:30:27,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:27,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2023-02-15 13:30:27,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:27,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515082148] [2023-02-15 13:30:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:27,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:27,338 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 13:30:27,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:27,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515082148] [2023-02-15 13:30:27,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515082148] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:27,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:27,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:30:27,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932901362] [2023-02-15 13:30:27,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:27,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:30:27,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:27,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:30:27,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:27,345 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 13:30:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:27,404 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-02-15 13:30:27,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:30:27,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 13:30:27,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:27,407 INFO L225 Difference]: With dead ends: 98 [2023-02-15 13:30:27,407 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 13:30:27,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:30:27,415 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 50 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:27,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 128 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:30:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 13:30:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 54. [2023-02-15 13:30:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 53 states have internal predecessors, (58), 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 13:30:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-02-15 13:30:27,432 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 9 [2023-02-15 13:30:27,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:27,432 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-02-15 13:30:27,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 13:30:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-02-15 13:30:27,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 13:30:27,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:27,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:27,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:30:27,434 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:30:27,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:27,434 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2023-02-15 13:30:27,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:27,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427101258] [2023-02-15 13:30:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:27,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:27,523 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 13:30:27,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:27,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427101258] [2023-02-15 13:30:27,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427101258] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:27,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:27,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:30:27,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975060503] [2023-02-15 13:30:27,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:27,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:30:27,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:27,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:30:27,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:27,528 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13:30:27,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:27,537 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2023-02-15 13:30:27,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:30:27,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 13:30:27,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:27,541 INFO L225 Difference]: With dead ends: 59 [2023-02-15 13:30:27,542 INFO L226 Difference]: Without dead ends: 59 [2023-02-15 13:30:27,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:27,547 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 106 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 13:30:27,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 106 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:30:27,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-15 13:30:27,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2023-02-15 13:30:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 54 states have internal predecessors, (59), 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 13:30:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2023-02-15 13:30:27,564 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 11 [2023-02-15 13:30:27,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:27,565 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2023-02-15 13:30:27,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13:30:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2023-02-15 13:30:27,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:30:27,569 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:27,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:27,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:30:27,569 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:30:27,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:27,570 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2023-02-15 13:30:27,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:27,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30296109] [2023-02-15 13:30:27,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:27,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:27,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:27,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30296109] [2023-02-15 13:30:27,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30296109] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:30:27,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894083172] [2023-02-15 13:30:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:27,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:27,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:30:27,684 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 13:30:27,722 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 13:30:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:27,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:30:27,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:30:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:27,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:30:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:27,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894083172] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:30:27,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:30:27,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-15 13:30:27,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084259550] [2023-02-15 13:30:27,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:30:27,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:30:27,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:27,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:30:27,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:30:27,919 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 13:30:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:27,936 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2023-02-15 13:30:27,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:30:27,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 13:30:27,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:27,942 INFO L225 Difference]: With dead ends: 70 [2023-02-15 13:30:27,942 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 13:30:27,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:30:27,943 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:27,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 206 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:30:27,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 13:30:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-15 13:30:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 states have internal predecessors, (74), 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 13:30:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2023-02-15 13:30:27,952 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 16 [2023-02-15 13:30:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:27,952 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2023-02-15 13:30:27,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 13:30:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2023-02-15 13:30:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 13:30:27,953 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:27,953 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:27,962 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 13:30:28,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 13:30:28,159 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:30:28,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:28,159 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2023-02-15 13:30:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:28,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075914303] [2023-02-15 13:30:28,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:28,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:28,333 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 13:30:28,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:28,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075914303] [2023-02-15 13:30:28,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075914303] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:28,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:28,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:30:28,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388319894] [2023-02-15 13:30:28,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:28,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:30:28,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:28,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:30:28,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:30:28,336 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 13:30:28,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:28,481 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2023-02-15 13:30:28,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:30:28,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 13:30:28,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:28,482 INFO L225 Difference]: With dead ends: 92 [2023-02-15 13:30:28,482 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 13:30:28,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:30:28,483 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 158 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:28,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 88 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 13:30:28,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2023-02-15 13:30:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 66 states have internal predecessors, (72), 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 13:30:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2023-02-15 13:30:28,501 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 31 [2023-02-15 13:30:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:28,501 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2023-02-15 13:30:28,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 13:30:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2023-02-15 13:30:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 13:30:28,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:28,502 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:28,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 13:30:28,503 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:30:28,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:28,503 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2023-02-15 13:30:28,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:28,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122735487] [2023-02-15 13:30:28,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:28,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 13:30:28,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:28,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122735487] [2023-02-15 13:30:28,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122735487] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:28,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:28,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:30:28,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618734252] [2023-02-15 13:30:28,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:28,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:30:28,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:28,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:30:28,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:30:28,771 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 13:30:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:28,903 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2023-02-15 13:30:28,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:30:28,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 13:30:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:28,904 INFO L225 Difference]: With dead ends: 73 [2023-02-15 13:30:28,904 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 13:30:28,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:30:28,906 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 155 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:28,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 60 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 13:30:28,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-02-15 13:30:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 69 states have internal predecessors, (75), 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 13:30:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2023-02-15 13:30:28,910 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 31 [2023-02-15 13:30:28,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:28,910 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2023-02-15 13:30:28,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 13:30:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2023-02-15 13:30:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 13:30:28,911 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:28,911 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:28,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 13:30:28,912 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:30:28,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash 142544443, now seen corresponding path program 1 times [2023-02-15 13:30:28,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:28,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056739127] [2023-02-15 13:30:28,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:28,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 13:30:29,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:29,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056739127] [2023-02-15 13:30:29,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056739127] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:30:29,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345386732] [2023-02-15 13:30:29,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:29,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:29,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:30:29,526 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 13:30:29,557 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 13:30:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:29,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 13:30:29,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:30:29,830 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 13:30:29,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:29,892 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 13:30:29,965 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 13:30:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 13:30:29,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:30:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 13:30:30,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345386732] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:30:30,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:30:30,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-15 13:30:30,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399826572] [2023-02-15 13:30:30,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:30:30,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 13:30:30,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:30,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 13:30:30,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2023-02-15 13:30:30,275 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:30:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:30,547 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2023-02-15 13:30:30,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:30:30,547 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-15 13:30:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:30,548 INFO L225 Difference]: With dead ends: 70 [2023-02-15 13:30:30,548 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 13:30:30,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2023-02-15 13:30:30,549 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 85 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:30,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 315 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 13:30:30,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-15 13:30:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 69 states have internal predecessors, (74), 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 13:30:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2023-02-15 13:30:30,552 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 33 [2023-02-15 13:30:30,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:30,552 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2023-02-15 13:30:30,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:30:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2023-02-15 13:30:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:30:30,553 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:30,553 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:30,561 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 13:30:30,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-02-15 13:30:30,754 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:30:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2023-02-15 13:30:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:30,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474963175] [2023-02-15 13:30:30,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:30,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:30:31,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:31,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474963175] [2023-02-15 13:30:31,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474963175] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:30:31,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535265772] [2023-02-15 13:30:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:31,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:31,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:30:31,891 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 13:30:31,897 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 13:30:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:32,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 13:30:32,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:30:32,071 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 13:30:32,113 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:30:32,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 18 [2023-02-15 13:30:32,154 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 13:30:32,161 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 13:30:32,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:32,195 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 13:30:32,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:32,203 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 31 treesize of output 26 [2023-02-15 13:30:32,262 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:30:32,262 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 19 treesize of output 18 [2023-02-15 13:30:32,273 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:30:32,274 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 29 treesize of output 28 [2023-02-15 13:30:32,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:32,510 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:30:32,510 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2023-02-15 13:30:32,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:32,522 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:30:32,522 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2023-02-15 13:30:32,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:32,555 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32 [2023-02-15 13:30:32,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:32,565 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 31 [2023-02-15 13:30:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:30:32,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:30:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:30:33,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535265772] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:30:33,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:30:33,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 27 [2023-02-15 13:30:33,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961448392] [2023-02-15 13:30:33,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:30:33,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 13:30:33,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:33,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 13:30:33,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:30:33,006 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 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 13:30:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:34,791 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2023-02-15 13:30:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 13:30:34,791 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 13:30:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:34,793 INFO L225 Difference]: With dead ends: 156 [2023-02-15 13:30:34,794 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 13:30:34,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=463, Invalid=1517, Unknown=0, NotChecked=0, Total=1980 [2023-02-15 13:30:34,796 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1262 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:34,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 284 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 13:30:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 13:30:34,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 80. [2023-02-15 13:30:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 79 states have internal predecessors, (90), 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 13:30:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2023-02-15 13:30:34,801 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 37 [2023-02-15 13:30:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:34,801 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2023-02-15 13:30:34,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 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 13:30:34,802 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2023-02-15 13:30:34,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:30:34,807 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:34,807 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:34,816 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 13:30:35,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:35,017 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:30:35,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2023-02-15 13:30:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:35,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365765204] [2023-02-15 13:30:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:35,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:30:36,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:36,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365765204] [2023-02-15 13:30:36,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365765204] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:30:36,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861052553] [2023-02-15 13:30:36,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:36,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:36,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:30:36,081 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 13:30:36,084 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 13:30:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:36,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 13:30:36,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:30:36,253 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 13:30:36,320 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:30:36,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 18 [2023-02-15 13:30:36,365 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 13:30:36,373 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 13:30:36,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:36,414 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 13:30:36,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:36,424 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 31 treesize of output 26 [2023-02-15 13:30:36,494 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:30:36,494 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 29 treesize of output 28 [2023-02-15 13:30:36,505 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:30:36,505 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 19 treesize of output 18 [2023-02-15 13:30:36,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:36,766 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:30:36,767 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2023-02-15 13:30:36,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:36,775 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:30:36,775 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2023-02-15 13:30:36,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:36,803 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32 [2023-02-15 13:30:36,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:36,814 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 31 [2023-02-15 13:30:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:30:36,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:30:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:30:38,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861052553] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:30:38,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:30:38,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 34 [2023-02-15 13:30:38,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638854353] [2023-02-15 13:30:38,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:30:38,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 13:30:38,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:38,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 13:30:38,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 13:30:38,925 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 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 13:30:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:43,121 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2023-02-15 13:30:43,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 13:30:43,122 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 13:30:43,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:43,124 INFO L225 Difference]: With dead ends: 156 [2023-02-15 13:30:43,124 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 13:30:43,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=963, Invalid=3069, Unknown=0, NotChecked=0, Total=4032 [2023-02-15 13:30:43,130 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1447 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:43,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 256 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 13:30:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 13:30:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 85. [2023-02-15 13:30:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 84 states have internal predecessors, (97), 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 13:30:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2023-02-15 13:30:43,133 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 37 [2023-02-15 13:30:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:43,134 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2023-02-15 13:30:43,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 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 13:30:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2023-02-15 13:30:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:30:43,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:43,139 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:43,148 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 13:30:43,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:43,348 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:30:43,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:43,349 INFO L85 PathProgramCache]: Analyzing trace with hash -494379317, now seen corresponding path program 1 times [2023-02-15 13:30:43,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:43,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501729606] [2023-02-15 13:30:43,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:43,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:30:44,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:44,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501729606] [2023-02-15 13:30:44,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501729606] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:30:44,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023826815] [2023-02-15 13:30:44,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:44,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:44,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:30:44,752 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 13:30:44,755 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 13:30:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:44,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-15 13:30:44,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:30:45,036 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 13:30:45,144 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 13:30:45,157 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 13:30:45,173 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:30:45,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-02-15 13:30:45,178 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 13:30:45,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:45,220 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 33 treesize of output 28 [2023-02-15 13:30:45,231 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:30:45,231 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 26 treesize of output 36 [2023-02-15 13:30:45,233 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 13:30:45,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:45,244 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 13:30:45,315 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:30:45,316 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 31 treesize of output 30 [2023-02-15 13:30:45,326 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:30:45,327 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 19 treesize of output 18 [2023-02-15 13:30:45,339 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 23 treesize of output 22 [2023-02-15 13:30:45,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:45,637 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:30:45,637 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2023-02-15 13:30:45,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:45,650 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:30:45,651 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2023-02-15 13:30:45,663 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:30:45,664 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 41 treesize of output 51 [2023-02-15 13:30:45,677 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 13:30:45,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:45,745 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 34 [2023-02-15 13:30:45,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:45,753 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 33 [2023-02-15 13:30:45,890 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 13:30:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:30:45,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:30:49,478 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse10 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse63 (select (store (let ((.cse64 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse64 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse64 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse63 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse63 .cse2)))))))))) (.cse12 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse61 (select (store (let ((.cse62 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse61 .cse6)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse61 .cse2)))))))))) (.cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse60 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse11 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse59 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))))) (.cse18 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse58 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))))) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and .cse0 (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) .cse3) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))) .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse5 (select (store (let ((.cse7 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 .cse6)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 .cse2))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 .cse2))))))) .cse10 .cse11 .cse12 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse13 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse13 .cse2))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse15 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse16 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse17 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse18 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse19 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))) .cse3) (or .cse3 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse20 .cse6)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse20 .cse2)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse22 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse22 .cse2))))))))) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse25 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse24 .cse6)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse24 .cse2))))) .cse3) .cse10 .cse11 .cse12 (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse26 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) .cse3) (or (let ((.cse27 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse57 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))) (.cse28 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse56 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))) (.cse32 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse55 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))) (.cse34 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse53 (select (store (let ((.cse54 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse53 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse53 .cse2)))))))) (.cse42 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse52 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))) (.cse40 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse50 (select (store (let ((.cse51 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 .cse6)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 .cse2)))))))) (.cse41 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse49 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))) (and (or .cse27 .cse3) (or (and .cse27 .cse28 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse29 .cse6)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse29 .cse2))))) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse31 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))) .cse32 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse33 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) .cse34 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse35 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse36 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse36 .cse2))))) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse38 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse38 .cse2))))) .cse40 .cse41 .cse42) .cse3) .cse28 (or (and .cse28 .cse32 .cse41) .cse3) .cse32 .cse34 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse43 (select (store (let ((.cse44 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse43 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse43 .cse2))))))) (or .cse42 .cse3) .cse40 .cse41 (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse45 (select (store (let ((.cse46 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse45 .cse6)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse45 .cse2))))) .cse3) (or .cse3 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse47 (select (store (let ((.cse48 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse47 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse47 .cse2)))))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) .cse18 (or (and .cse0 .cse11 .cse18) .cse3)))) is different from false [2023-02-15 13:30:50,689 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse34 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse63 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse63 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse63 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))) (.cse39 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse61 (select (store (let ((.cse62 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse61 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse61 .cse0)))))))))) (.cse40 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse59 (select (store (let ((.cse60 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse59 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse59 .cse0))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse35 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse58 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))))))) (.cse36 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse57 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))))))) (and (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) .cse2) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (let ((.cse3 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse33 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (.cse4 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))))) (.cse6 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse31 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))) (.cse11 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))) (.cse19 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse28 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse28 .cse0)))))))) (.cse5 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse27 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))))) (.cse22 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse25 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse25 .cse0))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (and .cse3 (or (and .cse3 .cse4 .cse5) .cse2) .cse4 (or .cse2 .cse6) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse7 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse0))))) .cse2) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse0))))))) (or (and .cse11 .cse3 .cse4 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse12 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse13 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse13 .cse0))))) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse15 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse16 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse16 .cse0))))) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse18 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) .cse19 .cse5 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse20 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse20 .cse0))))) .cse22 .cse6) .cse2) (or .cse11 .cse2) .cse19 (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse23 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse23 .cse0))))) .cse2) .cse5 .cse22))) .cse34 (or (and .cse34 .cse35 .cse36) .cse2) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse37 (select (store (let ((.cse38 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse37 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse37 .cse0))))) .cse2) .cse39 .cse40 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse41 (select (store (let ((.cse42 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse41 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse41 .cse0))))))))) .cse35 (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) .cse2) (or .cse2 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse44 (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse44 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse44 .cse0)))))) (or .cse2 (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse46 (select (store (let ((.cse47 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse46 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse46 .cse0))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse48 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))))) .cse34 .cse39 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse49 (select (store (let ((.cse50 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse49 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse49 .cse0))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse40 .cse35 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse51 (select (store (let ((.cse52 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse51 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse51 .cse0))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse53 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse54 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse55 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse56 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse36)) .cse36))) is different from false [2023-02-15 13:30:51,314 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse5 (forall ((v_subst_22 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_22) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse63 (store |c_#memory_int| v_subst_22 v_ArrVal_970))) (store .cse63 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse63 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_22 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_22)))) (.cse12 (forall ((v_subst_27 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_27) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_27) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse61 (select (store (let ((.cse62 (store |c_#memory_int| v_subst_27 v_ArrVal_970))) (store .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_27 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse61 .cse1)) (= (select .cse61 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse6 (forall ((v_subst_29 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse60 (store |c_#memory_int| v_subst_29 v_ArrVal_970))) (store .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_29 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_29))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_29)))) (.cse7 (forall ((v_subst_23 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_23) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_23) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse59 (store |c_#memory_int| v_subst_23 v_ArrVal_970))) (store .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_23 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (.cse19 (forall ((v_subst_20 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_20) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse57 (select (store (let ((.cse58 (store |c_#memory_int| v_subst_20 v_ArrVal_970))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_20 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse57 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse57 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_20)))) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (and (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_32 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_32) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_32) (= (select (select (store (let ((.cse0 (store |c_#memory_int| v_subst_32 v_ArrVal_970))) (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_32 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_33 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse3 (select (store (let ((.cse4 (store |c_#memory_int| v_subst_33 v_ArrVal_970))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_33 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse3 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_33) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_33) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse3 .cse1))))) .cse2) (or .cse2 (and .cse5 .cse6 .cse7)) .cse5 (or .cse2 (and (forall ((v_subst_28 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_28) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_int| v_subst_28 v_ArrVal_970))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_28 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 4)) (= (select .cse8 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_subst_18 Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select (select (store (let ((.cse10 (store |c_#memory_int| v_subst_18 v_ArrVal_970))) (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_18 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_18))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_18))) .cse5 (forall ((v_subst_19 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_19) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse11 (store |c_#memory_int| v_subst_19 v_ArrVal_970))) (store .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_19 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse12 .cse6 (forall ((v_subst_21 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_21) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int| v_subst_21 v_ArrVal_970))) (store .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_21 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse13 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse13 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse7 (forall ((v_subst_26 Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select (select (store (let ((.cse15 (store |c_#memory_int| v_subst_26 v_ArrVal_970))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_26 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_26))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_26))) (forall ((v_subst_24 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_24) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse16 (store |c_#memory_int| v_subst_24 v_ArrVal_970))) (store .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_24 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_subst_25 Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int| v_subst_25 v_ArrVal_970))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_25 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse17 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse17 .cse1))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_25))) .cse19 (forall ((v_subst_30 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_30) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse20 (store |c_#memory_int| v_subst_30 v_ArrVal_970))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_30 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))) .cse12 .cse6 (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (let ((.cse21 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_4 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_4) (= (select (select (store (let ((.cse51 (store |c_#memory_int| v_subst_4 v_ArrVal_970))) (store .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_4 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse22 (forall ((v_subst_9 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_9) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse50 (store |c_#memory_int| v_subst_9 v_ArrVal_970))) (store .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_9 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse25 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_11 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select (select (store (let ((.cse49 (store |c_#memory_int| v_subst_11 v_ArrVal_970))) (store .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_11 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_11)))) (.cse35 (forall ((v_subst_5 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse47 (select (store (let ((.cse48 (store |c_#memory_int| v_subst_5 v_ArrVal_970))) (store .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_5 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse47 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse47 .cse1))))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_5)))) (.cse23 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_10 Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_10) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse46 (store |c_#memory_int| v_subst_10 v_ArrVal_970))) (store .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_10 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse24 (forall ((v_subst_14 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse45 (store |c_#memory_int| v_subst_14 v_ArrVal_970))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_14 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_14)))) (.cse37 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_3 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse43 (select (store (let ((.cse44 (store |c_#memory_int| v_subst_3 v_ArrVal_970))) (store .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_3 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse43 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse43 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_3))))) (and (or .cse21 .cse2) (or .cse2 (and .cse22 .cse23 .cse24)) (or .cse25 .cse2) (forall ((v_subst_16 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_16) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int| v_subst_16 v_ArrVal_970))) (store .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_16 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse26 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse26 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse22 (or (forall ((v_ArrVal_973 Int) (v_subst_15 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int| v_subst_15 v_ArrVal_970))) (store .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_15 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_15) (= (select .cse28 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse28 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse2) (or (and .cse21 (forall ((v_ArrVal_973 Int) (v_subst_8 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse30 (store |c_#memory_int| v_subst_8 v_ArrVal_970))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_8 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse22 .cse25 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_2 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int| v_subst_2 v_ArrVal_970))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_2 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse31 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse31 4))))) (forall ((v_ArrVal_973 Int) (v_subst_13 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int| v_subst_13 v_ArrVal_970))) (store .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_13 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse33 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse33 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse35 .cse23 (forall ((v_ArrVal_973 Int) (v_subst_7 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse36 (store |c_#memory_int| v_subst_7 v_ArrVal_970))) (store .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_7 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) .cse24 .cse37 (forall ((v_ArrVal_973 Int) (v_subst_12 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse38 (store |c_#memory_int| v_subst_12 v_ArrVal_970))) (store .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_12 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) (forall ((v_ArrVal_973 Int) (v_subst_6 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int| v_subst_6 v_ArrVal_970))) (store .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_6 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse39 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse39 4)))))) .cse2) .cse35 .cse23 .cse24 .cse37 (or .cse2 (forall ((v_ArrVal_973 Int) (v_subst_17 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse41 (select (store (let ((.cse42 (store |c_#memory_int| v_subst_17 v_ArrVal_970))) (store .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_17 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse41 .cse1)) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_17) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse41 4))))))))) .cse7 (forall ((v_subst_34 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_34) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse52 (select (store (let ((.cse53 (store |c_#memory_int| v_subst_34 v_ArrVal_970))) (store .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_34 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse52 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse52 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_34))))) .cse19 (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_1 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse54 (select (store (let ((.cse55 (store |c_#memory_int| v_subst_1 v_ArrVal_970))) (store .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_1 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_1) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_1) (= (select .cse54 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse54 .cse1))))) .cse2) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_subst_31 Int) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_31) (= (select (select (store (let ((.cse56 (store |c_#memory_int| v_subst_31 v_ArrVal_970))) (store .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_31 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_31))) .cse2)))) is different from false [2023-02-15 13:30:51,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:51,508 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2023-02-15 13:30:51,511 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:51,520 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:51,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:51,529 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 41 treesize of output 43 [2023-02-15 13:30:51,538 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:51,550 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 41 treesize of output 29 [2023-02-15 13:30:51,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:51,562 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 13 treesize of output 15 [2023-02-15 13:30:51,573 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:51,574 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:51,581 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:51,581 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 13:30:51,589 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:51,589 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 13:30:51,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:51,597 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 91 treesize of output 61 [2023-02-15 13:30:51,599 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:51,610 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:30:51,610 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 1109 treesize of output 1062 [2023-02-15 13:30:51,616 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:51,619 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:51,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 0 case distinctions, treesize of input 1107 treesize of output 1059 [2023-02-15 13:30:51,627 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:51,629 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 517 treesize of output 493 [2023-02-15 13:30:51,634 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:51,636 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 1042 treesize of output 942 [2023-02-15 13:30:51,641 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:51,642 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 947 treesize of output 919 [2023-02-15 13:30:52,431 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,432 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,434 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,435 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,437 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,438 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,440 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,441 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,442 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,444 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,445 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,447 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,448 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,449 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,450 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,452 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,454 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,457 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,458 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,460 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,462 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,464 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,466 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,468 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,469 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:52,478 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:52,484 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,484 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 13:30:52,496 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,497 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:52,503 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,504 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:52,510 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,510 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 13:30:52,516 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,517 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:52,523 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,524 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:52,538 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,539 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:52,544 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,545 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:52,554 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,555 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 13:30:52,562 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,563 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 13:30:52,569 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,570 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:52,577 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,577 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 13:30:52,584 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,585 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:52,593 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,594 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 13:30:52,600 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,601 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 13:30:52,608 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,609 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:52,615 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,616 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:52,622 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,622 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:52,629 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,629 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:52,635 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,635 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:30:52,642 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:30:52,643 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 13:30:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 13 not checked. [2023-02-15 13:30:52,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023826815] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:30:52,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:30:52,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 48 [2023-02-15 13:30:52,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33277791] [2023-02-15 13:30:52,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:30:52,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-15 13:30:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:52,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-15 13:30:52,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1807, Unknown=43, NotChecked=264, Total=2256 [2023-02-15 13:30:52,800 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 48 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 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 13:31:01,610 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse71 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse65 (select .cse71 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse63 (select |c_#memory_int| .cse65)) (.cse68 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse64 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) (.cse66 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (let ((.cse3 (not .cse66)) (.cse9 (= (select .cse6 .cse64) |c_ULTIMATE.start_main_~data_init~0#1|)) (.cse11 (forall ((v_subst_22 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_22) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse81 (store |c_#memory_int| v_subst_22 v_ArrVal_970))) (store .cse81 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse81 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_22 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_22)))) (.cse18 (forall ((v_subst_27 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_27) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_27) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse79 (select (store (let ((.cse80 (store |c_#memory_int| v_subst_27 v_ArrVal_970))) (store .cse80 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse80 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_27 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse79 .cse1)) (= (select .cse79 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse12 (forall ((v_subst_29 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse78 (store |c_#memory_int| v_subst_29 v_ArrVal_970))) (store .cse78 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse78 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_29 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_29))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_29)))) (.cse27 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) (.cse62 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse65)) (.cse8 (select |c_#memory_int| .cse68)) (.cse7 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse68)) (.cse28 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0)) (.cse10 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse13 (forall ((v_subst_23 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_23) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_23) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse77 (store |c_#memory_int| v_subst_23 v_ArrVal_970))) (store .cse77 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse77 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_23 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (.cse29 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse25 (forall ((v_subst_20 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_20) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse75 (select (store (let ((.cse76 (store |c_#memory_int| v_subst_20 v_ArrVal_970))) (store .cse76 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse76 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_20 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse75 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse75 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_20)))) (.cse67 (= (select .cse63 4) |c_ULTIMATE.start_main_~data_init~0#1|)) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (and (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_32 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_32) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_32) (= (select (select (store (let ((.cse0 (store |c_#memory_int| v_subst_32 v_ArrVal_970))) (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_32 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) .cse3 (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_33 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse4 (select (store (let ((.cse5 (store |c_#memory_int| v_subst_33 v_ArrVal_970))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_33 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse4 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_33) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_33) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse4 .cse1))))) .cse2) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (or .cse7 (= (select .cse8 4) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse9 (not .cse10) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (or .cse2 (and .cse11 .cse12 .cse13)) (or (and (or (and .cse3 .cse9) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) .cse10) .cse11 (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (or .cse2 (and (forall ((v_subst_28 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_28) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| v_subst_28 v_ArrVal_970))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_28 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse14 4)) (= (select .cse14 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_subst_18 Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select (select (store (let ((.cse16 (store |c_#memory_int| v_subst_18 v_ArrVal_970))) (store .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_18 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_18))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_18))) .cse11 (forall ((v_subst_19 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_19) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse17 (store |c_#memory_int| v_subst_19 v_ArrVal_970))) (store .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_19 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse18 .cse12 (forall ((v_subst_21 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_21) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| v_subst_21 v_ArrVal_970))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_21 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse19 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse19 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse13 (forall ((v_subst_26 Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select (select (store (let ((.cse21 (store |c_#memory_int| v_subst_26 v_ArrVal_970))) (store .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_26 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_26))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_26))) (forall ((v_subst_24 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_24) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse22 (store |c_#memory_int| v_subst_24 v_ArrVal_970))) (store .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_24 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_subst_25 Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| v_subst_25 v_ArrVal_970))) (store .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_25 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse23 .cse1))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_25))) .cse25 (forall ((v_subst_30 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_30) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse26 (store |c_#memory_int| v_subst_30 v_ArrVal_970))) (store .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_30 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) .cse18 .cse27 .cse12 .cse28 (or .cse29 (let ((.cse30 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_4 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_4) (= (select (select (store (let ((.cse60 (store |c_#memory_int| v_subst_4 v_ArrVal_970))) (store .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_4 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse31 (forall ((v_subst_9 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_9) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse59 (store |c_#memory_int| v_subst_9 v_ArrVal_970))) (store .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_9 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse34 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_11 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select (select (store (let ((.cse58 (store |c_#memory_int| v_subst_11 v_ArrVal_970))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_11 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_11)))) (.cse44 (forall ((v_subst_5 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse56 (select (store (let ((.cse57 (store |c_#memory_int| v_subst_5 v_ArrVal_970))) (store .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_5 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse56 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse56 .cse1))))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_5)))) (.cse32 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_10 Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_10) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse55 (store |c_#memory_int| v_subst_10 v_ArrVal_970))) (store .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_10 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse33 (forall ((v_subst_14 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse54 (store |c_#memory_int| v_subst_14 v_ArrVal_970))) (store .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_14 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_14)))) (.cse46 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_3 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse52 (select (store (let ((.cse53 (store |c_#memory_int| v_subst_3 v_ArrVal_970))) (store .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_3 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse52 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse52 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_3))))) (and (or .cse30 .cse2) (or .cse2 (and .cse31 .cse32 .cse33)) (or .cse34 .cse2) (forall ((v_subst_16 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_16) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| v_subst_16 v_ArrVal_970))) (store .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_16 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse31 (or (forall ((v_ArrVal_973 Int) (v_subst_15 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse37 (select (store (let ((.cse38 (store |c_#memory_int| v_subst_15 v_ArrVal_970))) (store .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_15 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_15) (= (select .cse37 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse37 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse2) (or (and .cse30 (forall ((v_ArrVal_973 Int) (v_subst_8 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse39 (store |c_#memory_int| v_subst_8 v_ArrVal_970))) (store .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_8 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse31 .cse34 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_2 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse40 (select (store (let ((.cse41 (store |c_#memory_int| v_subst_2 v_ArrVal_970))) (store .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_2 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse40 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse40 4))))) (forall ((v_ArrVal_973 Int) (v_subst_13 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| v_subst_13 v_ArrVal_970))) (store .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_13 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse42 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse42 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse44 .cse32 (forall ((v_ArrVal_973 Int) (v_subst_7 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse45 (store |c_#memory_int| v_subst_7 v_ArrVal_970))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_7 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) .cse33 .cse46 (forall ((v_ArrVal_973 Int) (v_subst_12 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse47 (store |c_#memory_int| v_subst_12 v_ArrVal_970))) (store .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_12 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) (forall ((v_ArrVal_973 Int) (v_subst_6 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse48 (select (store (let ((.cse49 (store |c_#memory_int| v_subst_6 v_ArrVal_970))) (store .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_6 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse48 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse48 4)))))) .cse2) .cse44 .cse32 .cse33 .cse46 (or .cse2 (forall ((v_ArrVal_973 Int) (v_subst_17 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse50 (select (store (let ((.cse51 (store |c_#memory_int| v_subst_17 v_ArrVal_970))) (store .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_17 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 .cse1)) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_17) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 4))))))))) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) .cse2 (let ((.cse61 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and .cse61 .cse27 (or .cse62 (and (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse63 .cse64)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse65))))) (and .cse61 .cse66))) (or .cse62 .cse67) (or (and (or (and (= (select .cse8 .cse64) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse68))) .cse7) .cse28) .cse10) .cse13 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (forall ((v_subst_34 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_34) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse69 (select (store (let ((.cse70 (store |c_#memory_int| v_subst_34 v_ArrVal_970))) (store .cse70 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse70 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_34 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse69 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse69 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_34))))) .cse29 .cse25 (or (and (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) .cse67) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select .cse71 0))) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_1 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse72 (select (store (let ((.cse73 (store |c_#memory_int| v_subst_1 v_ArrVal_970))) (store .cse73 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse73 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_1 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_1) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_1) (= (select .cse72 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse72 .cse1))))) .cse2) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_subst_31 Int) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_31) (= (select (select (store (let ((.cse74 (store |c_#memory_int| v_subst_31 v_ArrVal_970))) (store .cse74 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse74 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_31 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_31))) .cse2)))))) is different from true [2023-02-15 13:31:08,370 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 174 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:31:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:10,294 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2023-02-15 13:31:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 13:31:10,295 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 13:31:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:10,296 INFO L225 Difference]: With dead ends: 123 [2023-02-15 13:31:10,296 INFO L226 Difference]: Without dead ends: 123 [2023-02-15 13:31:10,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=571, Invalid=4091, Unknown=46, NotChecked=548, Total=5256 [2023-02-15 13:31:10,302 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 429 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 41 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:31:10,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 384 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1299 Invalid, 15 Unknown, 294 Unchecked, 1.4s Time] [2023-02-15 13:31:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-15 13:31:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 85. [2023-02-15 13:31:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 84 states have internal predecessors, (96), 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 13:31:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2023-02-15 13:31:10,304 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 39 [2023-02-15 13:31:10,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:10,306 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2023-02-15 13:31:10,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 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 13:31:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2023-02-15 13:31:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:31:10,307 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:10,307 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:31:10,316 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 13:31:10,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 13:31:10,514 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:31:10,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1852999412, now seen corresponding path program 1 times [2023-02-15 13:31:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:10,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832972436] [2023-02-15 13:31:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:10,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:31:11,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:11,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832972436] [2023-02-15 13:31:11,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832972436] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:31:11,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850156703] [2023-02-15 13:31:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:11,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:31:11,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:31:11,133 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 13:31:11,160 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 13:31:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:11,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-15 13:31:11,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:31:11,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:31:11,364 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:31:11,365 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 13:31:11,399 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:31:11,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-15 13:31:11,456 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:31:11,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-15 13:31:11,563 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-15 13:31:11,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2023-02-15 13:31:11,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:31:11,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:11,646 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 22 treesize of output 21 [2023-02-15 13:31:11,698 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 20 treesize of output 19 [2023-02-15 13:31:11,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:11,838 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:31:11,838 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 1 case distinctions, treesize of input 37 treesize of output 34 [2023-02-15 13:31:11,892 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-02-15 13:31:11,893 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 21 [2023-02-15 13:31:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:31:11,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:31:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:31:12,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850156703] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:31:12,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:31:12,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 32 [2023-02-15 13:31:12,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089305425] [2023-02-15 13:31:12,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:31:12,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 13:31:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:31:12,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 13:31:12,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2023-02-15 13:31:12,400 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 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 13:31:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:13,031 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2023-02-15 13:31:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:31:13,031 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-15 13:31:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:13,032 INFO L225 Difference]: With dead ends: 105 [2023-02-15 13:31:13,032 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 13:31:13,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 13:31:13,033 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 391 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:31:13,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 371 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:31:13,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 13:31:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 81. [2023-02-15 13:31:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 80 states have internal predecessors, (90), 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 13:31:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-02-15 13:31:13,036 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 40 [2023-02-15 13:31:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:13,036 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-02-15 13:31:13,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 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 13:31:13,036 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-02-15 13:31:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:31:13,037 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:13,037 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:31:13,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 13:31:13,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:31:13,247 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:31:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:13,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2023-02-15 13:31:13,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:13,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979400258] [2023-02-15 13:31:13,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:13,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:31:15,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:15,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979400258] [2023-02-15 13:31:15,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979400258] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:31:15,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895500600] [2023-02-15 13:31:15,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:31:15,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:31:15,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:31:15,762 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 13:31:15,763 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 13:31:15,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:31:15,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:31:15,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 98 conjunts are in the unsatisfiable core [2023-02-15 13:31:15,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:31:15,987 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 13:31:16,031 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:31:16,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 18 [2023-02-15 13:31:16,083 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 13:31:16,087 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 13:31:16,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:16,134 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 13:31:16,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:16,141 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 31 treesize of output 26 [2023-02-15 13:31:16,207 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:31:16,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 34 [2023-02-15 13:31:16,304 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:31:16,305 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 36 treesize of output 31 [2023-02-15 13:31:16,317 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-15 13:31:16,317 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 23 treesize of output 22 [2023-02-15 13:31:16,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:16,398 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:31:16,398 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 1 case distinctions, treesize of input 65 treesize of output 46 [2023-02-15 13:31:16,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:16,407 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 13:31:16,408 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 13:31:16,530 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-15 13:31:16,530 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 3 case distinctions, treesize of input 63 treesize of output 60 [2023-02-15 13:31:16,552 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 13:31:16,552 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 3 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 13:31:17,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:17,060 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-15 13:31:17,061 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 117 [2023-02-15 13:31:17,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:17,077 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-15 13:31:17,077 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 97 [2023-02-15 13:31:17,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:17,747 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 13:31:17,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 72 [2023-02-15 13:31:17,767 INFO L321 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2023-02-15 13:31:17,768 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 84 [2023-02-15 13:31:17,855 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:31:17,883 INFO L321 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2023-02-15 13:31:17,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 111 treesize of output 84 [2023-02-15 13:31:17,920 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2023-02-15 13:31:17,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 52 [2023-02-15 13:31:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:31:18,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:31:27,701 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| Int) (v_ArrVal_1346 Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| v_ArrVal_1346))) (or (not (= (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)) (forall ((v_ArrVal_1362 Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1362)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| .cse1) (= (select .cse0 .cse1) 1))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| Int) (v_ArrVal_1346 Int)) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| v_ArrVal_1346))) (or (not (= (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)) (forall ((v_ArrVal_1362 Int)) (= (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1362)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 1)) (forall ((v_ArrVal_1361 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1361)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0)))))) is different from false [2023-02-15 13:33:16,734 WARN L233 SmtUtils]: Spent 34.50s on a formula simplification. DAG size of input: 82 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:33:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-15 13:33:17,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895500600] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:33:17,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:33:17,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 53 [2023-02-15 13:33:17,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260756007] [2023-02-15 13:33:17,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:33:17,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 13:33:17,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:33:17,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 13:33:17,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2596, Unknown=2, NotChecked=102, Total=2862 [2023-02-15 13:33:17,248 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 54 states, 53 states have (on average 2.056603773584906) internal successors, (109), 54 states have internal predecessors, (109), 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 13:33:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:33:32,880 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2023-02-15 13:33:32,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-15 13:33:32,881 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.056603773584906) internal successors, (109), 54 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 13:33:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:33:32,881 INFO L225 Difference]: With dead ends: 184 [2023-02-15 13:33:32,882 INFO L226 Difference]: Without dead ends: 184 [2023-02-15 13:33:32,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 60.0s TimeCoverageRelationStatistics Valid=1867, Invalid=7837, Unknown=2, NotChecked=194, Total=9900 [2023-02-15 13:33:32,884 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 2408 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2408 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:33:32,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2408 Valid, 647 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1928 Invalid, 0 Unknown, 122 Unchecked, 2.0s Time] [2023-02-15 13:33:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-15 13:33:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 84. [2023-02-15 13:33:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 83 states have internal predecessors, (95), 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 13:33:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2023-02-15 13:33:32,888 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 43 [2023-02-15 13:33:32,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:33:32,888 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2023-02-15 13:33:32,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.056603773584906) internal successors, (109), 54 states have internal predecessors, (109), 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 13:33:32,888 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2023-02-15 13:33:32,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:33:32,889 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:33:32,889 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:33:32,899 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 13:33:33,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:33:33,096 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 13:33:33,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:33:33,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728483, now seen corresponding path program 2 times [2023-02-15 13:33:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:33:33,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015108815] [2023-02-15 13:33:33,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:33:33,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:33:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:33:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:33:35,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:33:35,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015108815] [2023-02-15 13:33:35,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015108815] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:33:35,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372778965] [2023-02-15 13:33:35,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:33:35,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:33:35,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:33:35,062 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 13:33:35,065 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 13:33:35,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:33:35,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:33:35,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 106 conjunts are in the unsatisfiable core [2023-02-15 13:33:35,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:33:35,224 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 13:33:35,273 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:33:35,273 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 13:33:35,295 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:33:35,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-15 13:33:35,302 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 13:33:35,411 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:33:35,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 18 [2023-02-15 13:33:35,428 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-15 13:33:35,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2023-02-15 13:33:35,494 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 13:33:35,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:33:35,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:33:35,551 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 31 treesize of output 26 [2023-02-15 13:33:35,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:33:35,570 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 13:33:35,641 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:33:35,642 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 16 treesize of output 26 [2023-02-15 13:33:35,736 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:33:35,737 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 37 treesize of output 32 [2023-02-15 13:33:35,748 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-15 13:33:35,749 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 23 treesize of output 22 [2023-02-15 13:33:35,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:33:35,876 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:33:35,877 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 1 case distinctions, treesize of input 97 treesize of output 66 [2023-02-15 13:33:35,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:33:35,887 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 13:33:35,888 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 32 treesize of output 34 [2023-02-15 13:33:36,076 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 13:33:36,076 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 3 case distinctions, treesize of input 95 treesize of output 68 [2023-02-15 13:33:36,089 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 13:33:36,090 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 13:33:36,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:33:36,689 INFO L321 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2023-02-15 13:33:36,689 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 147 treesize of output 121 [2023-02-15 13:33:36,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:33:36,700 INFO L321 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2023-02-15 13:33:36,700 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 154 treesize of output 165 [2023-02-15 13:33:37,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:33:37,260 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 13:33:37,261 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 64 [2023-02-15 13:33:37,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:33:37,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:33:37,279 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-02-15 13:33:37,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2023-02-15 13:33:37,354 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:33:37,370 INFO L321 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2023-02-15 13:33:37,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 98 treesize of output 59 [2023-02-15 13:33:37,382 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:33:37,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 19 [2023-02-15 13:33:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:33:37,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:13,719 WARN L233 SmtUtils]: Spent 8.67s on a formula simplification. DAG size of input: 58 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:34:15,750 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1571 Int) (v_ArrVal_1556 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (let ((.cse1 (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (store .cse8 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|)))) (.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (store .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse6 (select .cse5 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|)) (.cse2 (select .cse1 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|))) (let ((.cse3 (select .cse2 0)) (.cse4 (select .cse6 0))) (let ((.cse0 (select (select (store .cse5 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store .cse6 4 v_ArrVal_1571)) .cse3) .cse4))) (or (forall ((v_ArrVal_1572 Int)) (<= (+ .cse0 8) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| v_ArrVal_1556) (select (select (store .cse1 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store .cse2 4 v_ArrVal_1572)) .cse3) .cse4)))) (= .cse0 0))))))) (forall ((v_ArrVal_1571 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (<= 0 (+ (let ((.cse9 (let ((.cse12 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (store .cse12 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse10 (select .cse9 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|))) (select (select (store .cse9 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store .cse10 4 v_ArrVal_1571)) (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (store .cse11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0)) (select .cse10 0)))) 4))) (forall ((v_ArrVal_1572 Int) (v_ArrVal_1556 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (let ((.cse18 (let ((.cse21 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (store .cse21 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|)))) (.cse14 (let ((.cse20 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (store .cse20 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse15 (select .cse14 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|)) (.cse19 (select .cse18 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|))) (let ((.cse16 (select .cse19 0)) (.cse17 (select .cse15 0))) (let ((.cse13 (select (select (store .cse18 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store .cse19 4 v_ArrVal_1572)) .cse16) .cse17))) (or (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| .cse13) (forall ((v_ArrVal_1571 Int)) (<= (+ (select (select (store .cse14 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store .cse15 4 v_ArrVal_1571)) .cse16) .cse17) 8) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| v_ArrVal_1556) .cse13)))))))))) is different from false