./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.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-2.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 c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:31:01,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:31:01,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:31:01,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:31:01,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:31:01,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:31:01,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:31:01,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:31:01,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:31:01,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:31:01,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:31:01,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:31:01,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:31:01,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:31:01,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:31:01,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:31:01,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:31:01,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:31:01,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:31:01,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:31:01,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:31:01,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:31:01,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:31:01,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:31:01,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:31:01,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:31:01,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:31:01,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:31:01,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:31:01,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:31:01,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:31:01,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:31:01,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:31:01,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:31:01,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:31:01,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:31:01,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:31:01,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:31:01,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:31:01,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:31:01,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:31:01,429 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:31:01,454 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:31:01,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:31:01,455 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:31:01,455 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:31:01,456 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:31:01,456 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:31:01,457 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:31:01,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:31:01,457 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:31:01,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:31:01,458 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:31:01,458 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:31:01,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:31:01,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:31:01,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:31:01,458 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:31:01,458 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:31:01,459 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:31:01,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:31:01,459 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:31:01,459 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:31:01,459 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:31:01,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:31:01,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:31:01,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:31:01,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:31:01,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:31:01,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:31:01,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:31:01,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:31:01,461 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:31:01,461 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:31:01,461 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:31:01,461 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:31:01,461 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 -> c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc [2023-02-15 13:31:01,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:31:01,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:31:01,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:31:01,679 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:31:01,679 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:31:01,680 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-2.i [2023-02-15 13:31:02,728 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:31:02,971 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:31:02,971 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2023-02-15 13:31:02,981 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c43f1d1d6/ea4ee531487b4836b02378735d1f2de2/FLAG0fb92dab9 [2023-02-15 13:31:02,989 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c43f1d1d6/ea4ee531487b4836b02378735d1f2de2 [2023-02-15 13:31:02,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:31:02,994 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:31:02,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:31:02,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:31:02,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:31:02,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:31:02" (1/1) ... [2023-02-15 13:31:03,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b8f4cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:31:03, skipping insertion in model container [2023-02-15 13:31:03,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:31:02" (1/1) ... [2023-02-15 13:31:03,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:31:03,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:31:03,237 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-2.i[24092,24105] [2023-02-15 13:31:03,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:31:03,247 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:31:03,274 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-2.i[24092,24105] [2023-02-15 13:31:03,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:31:03,295 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:31:03,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:31:03 WrapperNode [2023-02-15 13:31:03,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:31:03,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:31:03,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:31:03,299 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:31:03,303 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:31:03" (1/1) ... [2023-02-15 13:31:03,320 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:31:03" (1/1) ... [2023-02-15 13:31:03,332 INFO L138 Inliner]: procedures = 122, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2023-02-15 13:31:03,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:31:03,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:31:03,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:31:03,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:31:03,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:31:03" (1/1) ... [2023-02-15 13:31:03,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:31:03" (1/1) ... [2023-02-15 13:31:03,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:31:03" (1/1) ... [2023-02-15 13:31:03,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:31:03" (1/1) ... [2023-02-15 13:31:03,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:31:03" (1/1) ... [2023-02-15 13:31:03,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:31:03" (1/1) ... [2023-02-15 13:31:03,348 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:31:03" (1/1) ... [2023-02-15 13:31:03,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:31:03" (1/1) ... [2023-02-15 13:31:03,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:31:03,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:31:03,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:31:03,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:31:03,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:31:03" (1/1) ... [2023-02-15 13:31:03,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:31:03,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:31:03,377 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:31:03,385 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:31:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 13:31:03,404 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 13:31:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:31:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:31:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:31:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:31:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:31:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:31:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:31:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:31:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:31:03,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:31:03,488 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:31:03,490 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:31:03,520 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 13:31:03,671 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:31:03,675 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:31:03,675 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 13:31:03,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:31:03 BoogieIcfgContainer [2023-02-15 13:31:03,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:31:03,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:31:03,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:31:03,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:31:03,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:31:02" (1/3) ... [2023-02-15 13:31:03,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac4f9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:31:03, skipping insertion in model container [2023-02-15 13:31:03,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:31:03" (2/3) ... [2023-02-15 13:31:03,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac4f9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:31:03, skipping insertion in model container [2023-02-15 13:31:03,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:31:03" (3/3) ... [2023-02-15 13:31:03,683 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2023-02-15 13:31:03,695 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:31:03,695 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2023-02-15 13:31:03,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:31:03,726 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;@7f3b3d80, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:31:03,727 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-02-15 13:31:03,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 35 states have (on average 2.0) internal successors, (70), 61 states have internal predecessors, (70), 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:31:03,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 13:31:03,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:03,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 13:31:03,736 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:31:03,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:03,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2023-02-15 13:31:03,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:03,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515943545] [2023-02-15 13:31:03,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:03,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:03,873 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:31:03,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:03,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515943545] [2023-02-15 13:31:03,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515943545] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:31:03,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:31:03,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:31:03,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178468044] [2023-02-15 13:31:03,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:31:03,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:31:03,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:31:03,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:31:03,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:31:03,902 INFO L87 Difference]: Start difference. First operand has 63 states, 35 states have (on average 2.0) internal successors, (70), 61 states have internal predecessors, (70), 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:31:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:03,972 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2023-02-15 13:31:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:31:03,974 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:31:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:03,978 INFO L225 Difference]: With dead ends: 76 [2023-02-15 13:31:03,978 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 13:31:03,979 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:31:03,981 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 50 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:31:03,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 55 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:31:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 13:31:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2023-02-15 13:31:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.78125) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:31:04,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2023-02-15 13:31:04,002 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 4 [2023-02-15 13:31:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:04,002 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2023-02-15 13:31:04,003 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:31:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2023-02-15 13:31:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 13:31:04,003 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:04,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 13:31:04,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:31:04,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:31:04,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:04,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2023-02-15 13:31:04,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:04,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236934935] [2023-02-15 13:31:04,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:04,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:04,077 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:31:04,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:04,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236934935] [2023-02-15 13:31:04,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236934935] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:31:04,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:31:04,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:31:04,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169596700] [2023-02-15 13:31:04,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:31:04,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:31:04,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:31:04,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:31:04,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:31:04,081 INFO L87 Difference]: Start difference. First operand 54 states and 57 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:31:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:04,120 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2023-02-15 13:31:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:31:04,121 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:31:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:04,123 INFO L225 Difference]: With dead ends: 51 [2023-02-15 13:31:04,123 INFO L226 Difference]: Without dead ends: 51 [2023-02-15 13:31:04,124 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:31:04,125 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 34 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:31:04,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 34 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:31:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-15 13:31:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-15 13:31:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.6875) internal successors, (54), 50 states have internal predecessors, (54), 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:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2023-02-15 13:31:04,129 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2023-02-15 13:31:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:04,130 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2023-02-15 13:31:04,130 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:31:04,130 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2023-02-15 13:31:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:31:04,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:04,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:31:04,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:31:04,131 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:31:04,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:04,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2023-02-15 13:31:04,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:04,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853685523] [2023-02-15 13:31:04,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:04,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:04,227 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:31:04,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:04,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853685523] [2023-02-15 13:31:04,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853685523] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:31:04,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:31:04,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:31:04,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403625039] [2023-02-15 13:31:04,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:31:04,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:31:04,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:31:04,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:31:04,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:31:04,230 INFO L87 Difference]: Start difference. First operand 51 states and 54 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:31:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:04,301 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2023-02-15 13:31:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:31:04,302 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:31:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:04,303 INFO L225 Difference]: With dead ends: 82 [2023-02-15 13:31:04,304 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 13:31:04,305 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:31:04,307 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:31:04,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 95 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:31:04,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 13:31:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2023-02-15 13:31:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.625) internal successors, (52), 48 states have internal predecessors, (52), 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:04,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-02-15 13:31:04,314 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2023-02-15 13:31:04,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:04,314 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-02-15 13:31:04,314 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:31:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-02-15 13:31:04,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:31:04,315 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:04,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:31:04,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:31:04,315 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:31:04,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:04,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2023-02-15 13:31:04,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:04,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771085235] [2023-02-15 13:31:04,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:04,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:04,440 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:31:04,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:04,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771085235] [2023-02-15 13:31:04,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771085235] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:31:04,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:31:04,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:31:04,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108639795] [2023-02-15 13:31:04,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:31:04,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:31:04,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:31:04,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:31:04,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:31:04,444 INFO L87 Difference]: Start difference. First operand 49 states and 52 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:31:04,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:04,490 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2023-02-15 13:31:04,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:31:04,491 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:31:04,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:04,493 INFO L225 Difference]: With dead ends: 84 [2023-02-15 13:31:04,493 INFO L226 Difference]: Without dead ends: 84 [2023-02-15 13:31:04,494 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:31:04,497 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 104 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:31:04,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 104 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:31:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-15 13:31:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2023-02-15 13:31:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.5625) internal successors, (50), 46 states have internal predecessors, (50), 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:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2023-02-15 13:31:04,505 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2023-02-15 13:31:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:04,506 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2023-02-15 13:31:04,506 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:31:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2023-02-15 13:31:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 13:31:04,506 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:04,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:31:04,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:31:04,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:31:04,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:04,508 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2023-02-15 13:31:04,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:04,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150623507] [2023-02-15 13:31:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:04,578 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:31:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:04,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150623507] [2023-02-15 13:31:04,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150623507] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:31:04,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:31:04,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:31:04,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063609367] [2023-02-15 13:31:04,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:31:04,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:31:04,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:31:04,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:31:04,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:31:04,582 INFO L87 Difference]: Start difference. First operand 47 states and 50 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:31:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:04,590 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2023-02-15 13:31:04,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:31:04,590 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:31:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:04,591 INFO L225 Difference]: With dead ends: 52 [2023-02-15 13:31:04,591 INFO L226 Difference]: Without dead ends: 52 [2023-02-15 13:31:04,591 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:31:04,594 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 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:31:04,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:31:04,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-15 13:31:04,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2023-02-15 13:31:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 47 states have internal predecessors, (51), 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:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2023-02-15 13:31:04,601 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 11 [2023-02-15 13:31:04,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:04,601 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2023-02-15 13:31:04,603 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:31:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2023-02-15 13:31:04,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:31:04,604 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:04,605 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:31:04,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:31:04,605 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:31:04,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:04,606 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2023-02-15 13:31:04,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:04,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409239249] [2023-02-15 13:31:04,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:04,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:04,680 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:31:04,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:04,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409239249] [2023-02-15 13:31:04,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409239249] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:31:04,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293663028] [2023-02-15 13:31:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:04,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:31:04,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:31:04,683 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:31:04,689 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:31:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:04,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:31:04,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:31:04,815 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:31:04,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:31:04,838 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:31:04,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293663028] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:31:04,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:31:04,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-15 13:31:04,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840525810] [2023-02-15 13:31:04,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:31:04,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:31:04,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:31:04,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:31:04,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:31:04,840 INFO L87 Difference]: Start difference. First operand 48 states and 51 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:31:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:04,853 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2023-02-15 13:31:04,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:31:04,854 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:31:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:04,854 INFO L225 Difference]: With dead ends: 63 [2023-02-15 13:31:04,854 INFO L226 Difference]: Without dead ends: 63 [2023-02-15 13:31:04,854 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:31:04,855 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:31:04,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 138 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:31:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-15 13:31:04,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-15 13:31:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.375) internal successors, (66), 62 states have internal predecessors, (66), 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:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2023-02-15 13:31:04,859 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 16 [2023-02-15 13:31:04,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:04,859 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2023-02-15 13:31:04,859 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:31:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2023-02-15 13:31:04,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 13:31:04,860 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:04,860 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:31:04,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 13:31:05,068 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:31:05,068 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:31:05,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:05,069 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2023-02-15 13:31:05,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:05,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114084098] [2023-02-15 13:31:05,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:05,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:05,296 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:31:05,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:05,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114084098] [2023-02-15 13:31:05,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114084098] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:31:05,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:31:05,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:31:05,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637501969] [2023-02-15 13:31:05,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:31:05,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:31:05,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:31:05,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:31:05,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:31:05,298 INFO L87 Difference]: Start difference. First operand 63 states and 66 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:31:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:05,382 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2023-02-15 13:31:05,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:31:05,382 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:31:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:05,383 INFO L225 Difference]: With dead ends: 75 [2023-02-15 13:31:05,383 INFO L226 Difference]: Without dead ends: 75 [2023-02-15 13:31:05,383 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:31:05,384 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 124 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:31:05,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 66 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:31:05,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-15 13:31:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2023-02-15 13:31:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 59 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:31:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-02-15 13:31:05,387 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 31 [2023-02-15 13:31:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:05,387 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-02-15 13:31:05,387 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:31:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-02-15 13:31:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 13:31:05,388 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:05,388 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:31:05,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 13:31:05,388 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:31:05,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:05,389 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2023-02-15 13:31:05,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:05,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395216841] [2023-02-15 13:31:05,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:05,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:05,545 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:31:05,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:05,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395216841] [2023-02-15 13:31:05,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395216841] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:31:05,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:31:05,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:31:05,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923918781] [2023-02-15 13:31:05,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:31:05,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:31:05,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:31:05,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:31:05,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:31:05,547 INFO L87 Difference]: Start difference. First operand 60 states and 64 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:31:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:05,647 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2023-02-15 13:31:05,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:31:05,648 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:31:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:05,648 INFO L225 Difference]: With dead ends: 66 [2023-02-15 13:31:05,648 INFO L226 Difference]: Without dead ends: 66 [2023-02-15 13:31:05,649 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:31:05,649 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 131 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:31:05,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 47 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:31:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-15 13:31:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2023-02-15 13:31:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 62 states have internal predecessors, (67), 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:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2023-02-15 13:31:05,651 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 31 [2023-02-15 13:31:05,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:05,652 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2023-02-15 13:31:05,652 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:31:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2023-02-15 13:31:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 13:31:05,652 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:05,653 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:31:05,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 13:31:05,653 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:31:05,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:05,653 INFO L85 PathProgramCache]: Analyzing trace with hash 142544431, now seen corresponding path program 1 times [2023-02-15 13:31:05,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:05,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822143194] [2023-02-15 13:31:05,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:05,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:06,159 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:31:06,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:06,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822143194] [2023-02-15 13:31:06,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822143194] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:31:06,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170767442] [2023-02-15 13:31:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:06,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:31:06,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:31:06,169 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:31:06,173 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:31:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:06,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 13:31:06,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:31:06,415 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:31:06,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:06,467 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:06,520 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:31:06,533 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:31:06,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:31:06,737 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:31:06,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170767442] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:31:06,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:31:06,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-15 13:31:06,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668521164] [2023-02-15 13:31:06,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:31:06,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 13:31:06,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:31:06,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 13:31:06,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2023-02-15 13:31:06,739 INFO L87 Difference]: Start difference. First operand 63 states and 67 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:31:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:06,968 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2023-02-15 13:31:06,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:31:06,968 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:31:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:06,969 INFO L225 Difference]: With dead ends: 63 [2023-02-15 13:31:06,969 INFO L226 Difference]: Without dead ends: 63 [2023-02-15 13:31:06,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2023-02-15 13:31:06,971 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 189 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:31:06,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 325 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:31:06,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-15 13:31:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-15 13:31:06,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 62 states have internal predecessors, (66), 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:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2023-02-15 13:31:06,975 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 33 [2023-02-15 13:31:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:06,976 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2023-02-15 13:31:06,976 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:31:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2023-02-15 13:31:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:31:06,978 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:06,978 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:31:06,985 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:31:07,183 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:31:07,183 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:31:07,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:07,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2023-02-15 13:31:07,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:07,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696338873] [2023-02-15 13:31:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:07,951 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:31:07,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:07,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696338873] [2023-02-15 13:31:07,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696338873] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:31:07,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975857228] [2023-02-15 13:31:07,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:07,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:31:07,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:31:07,965 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:31:07,966 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:31:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:08,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 13:31:08,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:31:08,107 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:08,143 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:31:08,143 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:08,179 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:08,184 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:08,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:08,215 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:08,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:08,224 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:08,276 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:31:08,276 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:31:08,286 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:31:08,286 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:31:08,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:08,514 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:31:08,514 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:31:08,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:08,521 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:31:08,521 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:31:08,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:31:08,546 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:31:08,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:31:08,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 35 treesize of output 31 [2023-02-15 13:31:08,638 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:31:08,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:31:08,939 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:31:08,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975857228] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:31:08,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:31:08,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 27 [2023-02-15 13:31:08,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624829203] [2023-02-15 13:31:08,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:31:08,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 13:31:08,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:31:08,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 13:31:08,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:31:08,941 INFO L87 Difference]: Start difference. First operand 63 states and 66 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:31:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:10,233 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2023-02-15 13:31:10,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 13:31:10,234 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:31:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:10,235 INFO L225 Difference]: With dead ends: 122 [2023-02-15 13:31:10,235 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 13:31:10,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=450, Invalid=1442, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 13:31:10,236 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 874 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:31:10,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 261 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:31:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 13:31:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 72. [2023-02-15 13:31:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 71 states have internal predecessors, (80), 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,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2023-02-15 13:31:10,239 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 37 [2023-02-15 13:31:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:10,239 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2023-02-15 13:31:10,239 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:31:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2023-02-15 13:31:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:31:10,240 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:10,240 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:31:10,248 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:31:10,445 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:31:10,445 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:31:10,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:10,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2023-02-15 13:31:10,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:10,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298962669] [2023-02-15 13:31:10,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:10,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:11,136 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:31:11,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:11,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298962669] [2023-02-15 13:31:11,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298962669] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:31:11,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217963071] [2023-02-15 13:31:11,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:11,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:31:11,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:31:11,153 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:31:11,169 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:31:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:11,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-15 13:31:11,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:31:11,367 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:31:11,367 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 14 treesize of output 20 [2023-02-15 13:31:11,406 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:11,411 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:11,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:11,441 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:11,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:11,445 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:11,507 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:31:11,508 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:31:11,515 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:31:11,516 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:31:11,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:11,727 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:31:11,727 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:31:11,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:11,732 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:31:11,732 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:31:11,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:31:11,749 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:31:11,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:31:11,755 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:31:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:31:11,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:31:12,366 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 38 treesize of output 34 [2023-02-15 13:31:12,395 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:31:12,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217963071] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:31:12,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:31:12,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 36 [2023-02-15 13:31:12,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036100332] [2023-02-15 13:31:12,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:31:12,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-15 13:31:12,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:31:12,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-15 13:31:12,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 13:31:12,396 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 37 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 37 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:31:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:15,607 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2023-02-15 13:31:15,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 13:31:15,608 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 37 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:31:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:15,610 INFO L225 Difference]: With dead ends: 135 [2023-02-15 13:31:15,610 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 13:31:15,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=976, Invalid=3056, Unknown=0, NotChecked=0, Total=4032 [2023-02-15 13:31:15,618 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1129 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:31:15,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 251 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:31:15,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 13:31:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 74. [2023-02-15 13:31:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.25) internal successors, (80), 73 states have internal predecessors, (80), 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:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-02-15 13:31:15,637 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 37 [2023-02-15 13:31:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:15,637 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-02-15 13:31:15,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 37 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:31:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-02-15 13:31:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:31:15,638 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:15,638 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:31:15,648 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:31:15,843 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:31:15,843 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:31:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:15,844 INFO L85 PathProgramCache]: Analyzing trace with hash -494379329, now seen corresponding path program 1 times [2023-02-15 13:31:15,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:15,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562694829] [2023-02-15 13:31:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:15,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:17,225 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:31:17,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:17,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562694829] [2023-02-15 13:31:17,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562694829] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:31:17,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225131203] [2023-02-15 13:31:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:17,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:31:17,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:31:17,239 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:31:17,241 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:31:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:17,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-15 13:31:17,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:31:17,427 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:31:17,482 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:17,489 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:17,498 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:31:17,498 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 20 treesize of output 30 [2023-02-15 13:31:17,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:31:17,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:17,547 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 35 treesize of output 30 [2023-02-15 13:31:17,554 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:31:17,555 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 28 treesize of output 38 [2023-02-15 13:31:17,558 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 13:31:17,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:17,564 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:17,639 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:31:17,639 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:31:17,642 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:31:17,649 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:31:17,650 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:31:17,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:17,914 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:31:17,915 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:31:17,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:17,922 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:31:17,922 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:31:17,933 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:31:17,933 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:31:17,948 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 13:31:17,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:31:17,963 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:31:17,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:31:17,971 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:31:18,050 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:31:18,082 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:31:18,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:31:19,847 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse4 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse64 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse5 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= (select (select (store (let ((.cse63 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))))))) (.cse6 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse62 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse41 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse60 (select (store (let ((.cse61 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse61 |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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse60 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse60 .cse8) |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|)))) (.cse46 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse58 (select (store (let ((.cse59 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse58 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse58 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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|))) .cse2) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse3 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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 v_ArrVal_980 .cse1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse2) .cse4 (or (and .cse4 .cse5 .cse6) .cse2) (or (let ((.cse10 (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_969 (Array Int Int)) (v_ArrVal_980 (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_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse37 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse37 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse12 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse35 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)))))))) (.cse16 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse34 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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 v_ArrVal_980 .cse1))))) (.cse15 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse33 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse11 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (.cse17 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= (select (select (store (let ((.cse31 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))))) (.cse18 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .cse8) |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_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)))))))) (and (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse7 (select (store (let ((.cse9 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse7 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse2) .cse10 (or .cse11 .cse2) .cse12 (or .cse2 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse13 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse13 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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 v_ArrVal_980 .cse1)))))) .cse15 (or .cse16 .cse2) (or (and .cse15 .cse17 .cse18) .cse2) .cse17 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_980 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse19 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse19 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))))) (or (and .cse10 .cse12 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (let ((.cse21 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse22 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)))) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_980 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))) .cse16 .cse15 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_980 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse25 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)))) .cse11 .cse17 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse26 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse26 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse28 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse28 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse18) .cse2) .cse18)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse39 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse39 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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|)))) .cse2) .cse5 .cse6 .cse41 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_980 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse42 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse42 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse44 (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse44 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse44 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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 v_ArrVal_980 .cse1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse2) .cse46 (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) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (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_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_980 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse47 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse47 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))))) .cse4 (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) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (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_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse49 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse49 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse51 (select (store (let ((.cse52 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse51 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse51 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))) (= |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) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= (select (select (store (let ((.cse53 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)))))) .cse5 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= (select (select (store (let ((.cse54 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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|))) .cse6 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse55 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |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|))) .cse41 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store (let ((.cse56 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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 v_ArrVal_980 .cse1)))) (= |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 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .cse8) |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_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse46) .cse2)))) is different from false [2023-02-15 13:31:20,668 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse6 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse62 (select (store (let ((.cse63 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse62 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse62 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4)))))))))) (.cse16 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse60 (select (store (let ((.cse61 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse61 |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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse60 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse60 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|)))) (.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 ((|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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse59 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse1 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= (select (select (store (let ((.cse58 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4)) (= (select v_ArrVal_980 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|)))) (.cse8 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= (select (select (store (let ((.cse57 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4))))))))) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (and .cse0 .cse1 (or .cse2 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse3 (select (store (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse3 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse3 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) .cse6 (or (and .cse0 .cse1 (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) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= (select (select (store (let ((.cse7 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4)))))) .cse6 .cse8 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= (select (select (store (let ((.cse9 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4)) (= (select v_ArrVal_980 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|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= (select (select (store (let ((.cse10 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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|))) (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) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse11 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse13 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |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|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse14 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse14 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse16 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store (let ((.cse17 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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 v_ArrVal_980 .cse4)))) (= |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 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse18 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse18 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4)) (= (select v_ArrVal_980 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|)))) .cse2) .cse8 (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse20 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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 v_ArrVal_980 .cse4)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse2) (or .cse2 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse21 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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|)))) .cse16 (or (let ((.cse24 (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_969 (Array Int Int)) (v_ArrVal_980 (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_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse51 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse51 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4)))))))) (.cse26 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= (select (select (store (let ((.cse50 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse29 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse48 (select (store (let ((.cse49 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse48 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse48 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse25 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse47 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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 v_ArrVal_980 .cse4))))) (.cse27 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse46 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= (select (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4))))))) (.cse37 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse44 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (and (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse22 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse22 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse2) .cse24 (or .cse25 .cse2) .cse26 (or .cse2 (and .cse26 .cse27 .cse28)) .cse29 (or (and .cse24 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse31 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4)))) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse26 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse33 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse33 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse29 .cse25 .cse27 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse35 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4))))) .cse37 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse38 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse38 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse28) .cse2) .cse27 (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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse40 (select (store (let ((.cse41 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse40 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse40 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse42 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse42 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4))))) .cse2) .cse28 (or .cse2 .cse37))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (or .cse2 (and .cse0 .cse1 .cse8)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse53 (select (store (let ((.cse54 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse53 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse53 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|)))) .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_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse55 (select (store (let ((.cse56 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse55 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse55 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse4)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))))))) is different from false [2023-02-15 13:31:21,097 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse6 (forall ((v_subst_21 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_21) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_21) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse62 (select (store (let ((.cse63 (store |c_#memory_int| v_subst_21 v_ArrVal_969))) (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_21 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse62 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse62 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse4 (forall ((v_subst_2 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse61 (store |c_#memory_int| v_subst_2 v_ArrVal_969))) (store .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse61 |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_980) |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_2))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_2)))) (.cse17 (forall ((v_subst_34 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_34) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse59 (select (store (let ((.cse60 (store |c_#memory_int| v_subst_34 v_ArrVal_969))) (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_34 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse59 4)) (= (select .cse59 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_34)))) (.cse19 (forall ((v_subst_25 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_25) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_25) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse58 (store |c_#memory_int| v_subst_25 v_ArrVal_969))) (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_25 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse20 (forall ((v_subst_1 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_1) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse57 (store |c_#memory_int| v_subst_1 v_ArrVal_969))) (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_1 v_ArrVal_980) |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_1))))))) (and (or (forall ((v_ArrVal_973 Int) (v_subst_24 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| v_subst_24 v_ArrVal_969))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |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_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse0 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_24) (= (select .cse0 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_24)))) .cse3) .cse4 (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_20 Int)) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse5 (store |c_#memory_int| v_subst_20 v_ArrVal_969))) (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_20 v_ArrVal_980) |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_20) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_20))) .cse3) .cse6 (or .cse3 (and .cse4 (forall ((v_subst_26 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_int| v_subst_26 v_ArrVal_969))) (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))) v_subst_26 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse1))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_26))) (forall ((v_subst_30 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int| v_subst_30 v_ArrVal_969))) (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_30 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_30))) (forall ((v_subst_29 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse11 (store |c_#memory_int| v_subst_29 v_ArrVal_969))) (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_29 v_ArrVal_980) |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_29))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_29))) .cse6 (forall ((v_subst_27 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int| v_subst_27 v_ArrVal_969))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |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_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse12 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 4))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_27))) (forall ((v_subst_32 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_32) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse14 (store |c_#memory_int| v_subst_32 v_ArrVal_969))) (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_32 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_subst_33 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse15 (store |c_#memory_int| v_subst_33 v_ArrVal_969))) (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_33 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_33))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_33))) (forall ((v_subst_31 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .cse1) |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| v_subst_31 v_ArrVal_969))) (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_31 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_31))) .cse17 (forall ((v_subst_28 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse18 (store |c_#memory_int| v_subst_28 v_ArrVal_969))) (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_28 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_28))) .cse19 .cse20)) (or (let ((.cse23 (forall ((v_subst_12 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_12) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse50 (select (store (let ((.cse51 (store |c_#memory_int| v_subst_12 v_ArrVal_969))) (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_12 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 .cse1)) (= (select .cse50 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse24 (forall ((v_subst_13 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse48 (select (store (let ((.cse49 (store |c_#memory_int| v_subst_13 v_ArrVal_969))) (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_13 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse48 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse48 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_13)))) (.cse28 (forall ((v_subst_5 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_5) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse47 (store |c_#memory_int| v_subst_5 v_ArrVal_969))) (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_5 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)) (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse27 (forall ((v_ArrVal_973 Int) (v_subst_9 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_9) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse46 (store |c_#memory_int| v_subst_9 v_ArrVal_969))) (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_9 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1))))) (.cse31 (forall ((v_ArrVal_973 Int) (v_subst_17 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_17) (= (select (select (store (let ((.cse45 (store |c_#memory_int| v_subst_17 v_ArrVal_969))) (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_17 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse29 (forall ((v_subst_15 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_15) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse44 (store |c_#memory_int| v_subst_15 v_ArrVal_969))) (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_15 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse30 (forall ((v_subst_6 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_6) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse43 (store |c_#memory_int| v_subst_6 v_ArrVal_969))) (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_6 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (and (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_4 Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| v_subst_4 v_ArrVal_969))) (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_4 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_4) (= (select .cse21 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse3) .cse23 .cse24 (or .cse3 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_subst_7 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int| v_subst_7 v_ArrVal_969))) (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_7 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_7) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse25 4)) (= (select .cse25 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse27 .cse3) .cse28 (or .cse3 (and .cse28 .cse29 .cse30)) (or .cse3 .cse31) (or (and (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (v_subst_10 Int)) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int| v_subst_10 v_ArrVal_969))) (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))) v_subst_10 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse32 .cse1)) (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse32 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse23 .cse24 (forall ((v_ArrVal_973 Int) (v_subst_8 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= (select (select (store (let ((.cse34 (store |c_#memory_int| v_subst_8 v_ArrVal_969))) (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_8 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse28 .cse27 (forall ((v_ArrVal_973 Int) (v_subst_18 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse35 (store |c_#memory_int| v_subst_18 v_ArrVal_969))) (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))) v_subst_18 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse29 .cse31 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_subst_16 Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int| v_subst_16 v_ArrVal_969))) (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))) v_subst_16 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse36 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse36 .cse1))))) (forall ((v_ArrVal_973 Int) (v_subst_14 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse38 (store |c_#memory_int| v_subst_14 v_ArrVal_969))) (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_14 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (v_subst_11 Int)) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int| v_subst_11 v_ArrVal_969))) (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_11 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse39 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse39 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse30) .cse3) .cse29 (forall ((v_subst_19 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_19) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse41 (select (store (let ((.cse42 (store |c_#memory_int| v_subst_19 v_ArrVal_969))) (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_19 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse41 .cse1)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse41 4))))))) .cse30)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (forall ((v_subst_3 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_3) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_3) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse52 (select (store (let ((.cse53 (store |c_#memory_int| v_subst_3 v_ArrVal_969))) (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_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .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|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or (and .cse4 .cse19 .cse20) .cse3) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (v_subst_22 Int)) (or (= (select (select (store (let ((.cse54 (store |c_#memory_int| v_subst_22 v_ArrVal_969))) (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_22 v_ArrVal_980) |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_22) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_22))) .cse3) .cse17 .cse19 (or .cse3 (forall ((v_ArrVal_973 Int) (v_subst_23 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse55 (select (store (let ((.cse56 (store |c_#memory_int| v_subst_23 v_ArrVal_969))) (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_23 v_ArrVal_980) |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_23) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_23) (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse55 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse55 4) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse20))) is different from false [2023-02-15 13:31:21,228 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:31:21,229 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:31:21,231 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:31:21,231 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:31:21,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:31:21,238 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:31:21,247 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,252 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:31:21,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:31:21,265 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,265 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:31:21,271 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,272 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:31:21,277 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,277 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:31:21,283 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,283 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:31:21,287 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,287 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:31:21,292 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,293 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:31:21,297 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,298 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:31:21,303 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,303 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:31:21,310 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,310 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:31:21,315 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,317 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:31:21,322 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,322 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:31:21,327 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:31:21,332 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,333 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:31:21,337 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,337 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:31:21,342 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,342 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:31:21,347 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,347 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:31:21,351 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,353 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:31:21,359 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,359 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:31:21,364 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,364 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:31:21,369 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,369 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:31:21,386 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,387 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:31:21,391 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,391 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:31:21,396 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,397 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:31:21,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:31:21,401 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:31:21,403 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:31:21,410 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:31:21,410 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 269 treesize of output 258 [2023-02-15 13:31:21,413 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:31:21,415 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:31:21,415 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 261 treesize of output 249 [2023-02-15 13:31:21,418 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:31:21,419 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 261 treesize of output 231 [2023-02-15 13:31:21,423 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:31:21,423 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 122 treesize of output 112 [2023-02-15 13:31:21,427 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:31:21,428 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 112 treesize of output 106 [2023-02-15 13:31:21,478 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,479 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,481 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,483 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,484 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,485 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,486 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,488 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,490 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,491 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,493 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,494 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,496 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,497 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,498 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,499 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,500 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,501 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,502 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,503 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,504 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,505 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,506 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,507 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,508 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:31:21,514 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,515 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:31:21,519 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:31:21,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 13:31:21,622 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:31:21,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225131203] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:31:21,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:31:21,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 44 [2023-02-15 13:31:21,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847911070] [2023-02-15 13:31:21,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:31:21,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 13:31:21,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:31:21,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 13:31:21,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1487, Unknown=30, NotChecked=240, Total=1892 [2023-02-15 13:31:21,625 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 44 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 44 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:31:30,027 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse59 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse7 (select .cse59 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse9 (forall ((v_subst_21 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_21) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_21) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse68 (select (store (let ((.cse69 (store |c_#memory_int| v_subst_21 v_ArrVal_969))) (store .cse69 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse69 |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_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse68 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse68 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse4 (forall ((v_subst_2 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse67 (store |c_#memory_int| v_subst_2 v_ArrVal_969))) (store .cse67 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse67 |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_980) |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_2))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_2)))) (.cse20 (forall ((v_subst_34 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_34) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse65 (select (store (let ((.cse66 (store |c_#memory_int| v_subst_34 v_ArrVal_969))) (store .cse66 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse66 |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_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse65 4)) (= (select .cse65 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_34)))) (.cse55 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse8 (select |c_#memory_int| .cse7)) (.cse6 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) (.cse22 (forall ((v_subst_25 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_25) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_25) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse64 (store |c_#memory_int| v_subst_25 v_ArrVal_969))) (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))) v_subst_25 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse23 (forall ((v_subst_1 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_1) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse63 (store |c_#memory_int| v_subst_1 v_ArrVal_969))) (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_1 v_ArrVal_980) |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_1))))))) (and (or (forall ((v_ArrVal_973 Int) (v_subst_24 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| v_subst_24 v_ArrVal_969))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |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_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse0 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_24) (= (select .cse0 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_24)))) .cse3) .cse4 (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_20 Int)) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse5 (store |c_#memory_int| v_subst_20 v_ArrVal_969))) (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_20 v_ArrVal_980) |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_20) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_20))) .cse3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse7) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 .cse6))) (= (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|) .cse9 (or .cse3 (and .cse4 (forall ((v_subst_26 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse10 (select (store (let ((.cse11 (store |c_#memory_int| v_subst_26 v_ArrVal_969))) (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_26 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse10 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 .cse1))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_26))) (forall ((v_subst_30 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int| v_subst_30 v_ArrVal_969))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |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_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse12 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse12 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_30))) (forall ((v_subst_29 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse14 (store |c_#memory_int| v_subst_29 v_ArrVal_969))) (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_29 v_ArrVal_980) |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_29))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_29))) .cse9 (forall ((v_subst_27 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int| v_subst_27 v_ArrVal_969))) (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_27 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse15 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse15 4))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_27))) (forall ((v_subst_32 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_32) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse17 (store |c_#memory_int| v_subst_32 v_ArrVal_969))) (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_32 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_subst_33 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse18 (store |c_#memory_int| v_subst_33 v_ArrVal_969))) (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_33 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_33))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_33))) (forall ((v_subst_31 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .cse1) |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| v_subst_31 v_ArrVal_969))) (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))) v_subst_31 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_31))) .cse20 (forall ((v_subst_28 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse21 (store |c_#memory_int| v_subst_28 v_ArrVal_969))) (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_28 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_28))) .cse22 .cse23)) (or (let ((.cse26 (forall ((v_subst_12 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_12) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse53 (select (store (let ((.cse54 (store |c_#memory_int| v_subst_12 v_ArrVal_969))) (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_12 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse53 .cse1)) (= (select .cse53 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse27 (forall ((v_subst_13 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse51 (select (store (let ((.cse52 (store |c_#memory_int| v_subst_13 v_ArrVal_969))) (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))) v_subst_13 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse51 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse51 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_13)))) (.cse31 (forall ((v_subst_5 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_5) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse50 (store |c_#memory_int| v_subst_5 v_ArrVal_969))) (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_5 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)) (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse30 (forall ((v_ArrVal_973 Int) (v_subst_9 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_9) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse49 (store |c_#memory_int| v_subst_9 v_ArrVal_969))) (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_9 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1))))) (.cse34 (forall ((v_ArrVal_973 Int) (v_subst_17 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_17) (= (select (select (store (let ((.cse48 (store |c_#memory_int| v_subst_17 v_ArrVal_969))) (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_17 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse32 (forall ((v_subst_15 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_15) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .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_15 v_ArrVal_969))) (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_15 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse33 (forall ((v_subst_6 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_6) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse46 (store |c_#memory_int| v_subst_6 v_ArrVal_969))) (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_6 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (and (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_4 Int)) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int| v_subst_4 v_ArrVal_969))) (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))) v_subst_4 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse24 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_4) (= (select .cse24 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse3) .cse26 .cse27 (or .cse3 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_subst_7 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int| v_subst_7 v_ArrVal_969))) (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_7 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_7) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse28 4)) (= (select .cse28 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse30 .cse3) .cse31 (or .cse3 (and .cse31 .cse32 .cse33)) (or .cse3 .cse34) (or (and (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (v_subst_10 Int)) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| v_subst_10 v_ArrVal_969))) (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_10 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse35 .cse1)) (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse26 .cse27 (forall ((v_ArrVal_973 Int) (v_subst_8 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= (select (select (store (let ((.cse37 (store |c_#memory_int| v_subst_8 v_ArrVal_969))) (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))) v_subst_8 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse31 .cse30 (forall ((v_ArrVal_973 Int) (v_subst_18 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse38 (store |c_#memory_int| v_subst_18 v_ArrVal_969))) (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_18 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse32 .cse34 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_subst_16 Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int| v_subst_16 v_ArrVal_969))) (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_16 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse39 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse39 .cse1))))) (forall ((v_ArrVal_973 Int) (v_subst_14 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse41 (store |c_#memory_int| v_subst_14 v_ArrVal_969))) (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_14 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (v_subst_11 Int)) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| v_subst_11 v_ArrVal_969))) (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_11 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse42 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse42 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse33) .cse3) .cse32 (forall ((v_subst_19 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_19) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse44 (select (store (let ((.cse45 (store |c_#memory_int| v_subst_19 v_ArrVal_969))) (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_19 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse44 .cse1)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse44 4))))))) .cse33)) .cse55) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_subst_3 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_3) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_3) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse56 (select (store (let ((.cse57 (store |c_#memory_int| v_subst_3 v_ArrVal_969))) (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_3 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse56 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse56 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (= (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) (or (and .cse4 .cse22 .cse23) .cse3) (= (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) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) .cse3 (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (v_subst_22 Int)) (or (= (select (select (store (let ((.cse58 (store |c_#memory_int| v_subst_22 v_ArrVal_969))) (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_22 v_ArrVal_980) |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_22) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_22))) .cse3) .cse20 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) .cse55 (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|))) (= (select .cse8 4) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select .cse59 0))) (let ((.cse60 (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|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse60) (= (select (select |c_#memory_int| .cse60) .cse6) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse22 (or .cse3 (forall ((v_ArrVal_973 Int) (v_subst_23 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse61 (select (store (let ((.cse62 (store |c_#memory_int| v_subst_23 v_ArrVal_969))) (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_23 v_ArrVal_980) |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_23) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_23) (= (select v_ArrVal_980 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse61 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse61 4) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse23)))) is different from true [2023-02-15 13:31:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:32,343 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2023-02-15 13:31:32,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 13:31:32,344 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 44 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 13:31:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:32,347 INFO L225 Difference]: With dead ends: 93 [2023-02-15 13:31:32,349 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 13:31:32,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=506, Invalid=3508, Unknown=34, NotChecked=508, Total=4556 [2023-02-15 13:31:32,351 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 235 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 23 mSolverCounterUnsat, 78 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 78 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:31:32,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 349 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 936 Invalid, 78 Unknown, 168 Unchecked, 1.0s Time] [2023-02-15 13:31:32,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 13:31:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2023-02-15 13:31:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.234375) internal successors, (79), 73 states have internal predecessors, (79), 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:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2023-02-15 13:31:32,355 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 39 [2023-02-15 13:31:32,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:32,355 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2023-02-15 13:31:32,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 44 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:31:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2023-02-15 13:31:32,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:31:32,355 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:32,356 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:32,360 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:32,560 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:32,561 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:31:32,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:32,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1852999400, now seen corresponding path program 1 times [2023-02-15 13:31:32,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:32,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576235233] [2023-02-15 13:31:32,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:32,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:33,002 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:33,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:33,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576235233] [2023-02-15 13:31:33,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576235233] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:31:33,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127806157] [2023-02-15 13:31:33,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:33,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:31:33,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:31:33,004 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:33,041 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:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:33,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-15 13:31:33,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:31:33,148 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:33,179 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:31:33,179 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:33,199 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:31:33,199 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:33,232 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:31:33,233 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:33,291 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-15 13:31:33,292 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:33,319 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:33,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:33,348 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:33,381 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:33,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:33,476 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:31:33,476 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:33,511 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-02-15 13:31:33,511 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:33,515 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:33,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:31:33,828 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:33,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127806157] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:31:33,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:31:33,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 32 [2023-02-15 13:31:33,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99177663] [2023-02-15 13:31:33,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:31:33,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 13:31:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:31:33,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 13:31:33,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2023-02-15 13:31:33,830 INFO L87 Difference]: Start difference. First operand 74 states and 79 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:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:31:34,276 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2023-02-15 13:31:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:31:34,277 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:34,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:31:34,277 INFO L225 Difference]: With dead ends: 83 [2023-02-15 13:31:34,277 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 13:31:34,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 13:31:34,278 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 327 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:31:34,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 332 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:31:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 13:31:34,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2023-02-15 13:31:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 67 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:31:34,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2023-02-15 13:31:34,280 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 40 [2023-02-15 13:31:34,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:31:34,280 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2023-02-15 13:31:34,281 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:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2023-02-15 13:31:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:31:34,281 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:31:34,281 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:34,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:31:34,482 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:34,482 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:31:34,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:31:34,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2023-02-15 13:31:34,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:31:34,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970129739] [2023-02-15 13:31:34,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:34,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:31:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:31:35,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:35,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970129739] [2023-02-15 13:31:35,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970129739] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:31:35,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636298243] [2023-02-15 13:31:35,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:31:35,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:31:35,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:31:35,605 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:35,608 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:35,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:31:35,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:31:35,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 83 conjunts are in the unsatisfiable core [2023-02-15 13:31:35,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:31:35,757 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:35,787 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:31:35,787 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:35,812 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:35,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:35,836 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:35,868 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:31:35,868 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:35,910 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:31:35,910 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:31:35,918 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:35,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:35,950 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:31:35,950 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 43 treesize of output 36 [2023-02-15 13:31:35,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:35,956 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:36,052 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-15 13:31:36,053 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 41 treesize of output 50 [2023-02-15 13:31:36,063 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:31:36,063 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:31:36,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:36,385 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 13:31:36,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 85 [2023-02-15 13:31:36,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:36,390 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-15 13:31:36,391 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 73 treesize of output 72 [2023-02-15 13:31:36,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:31:36,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 82 [2023-02-15 13:31:36,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:36,819 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 13:31:36,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 54 [2023-02-15 13:31:36,872 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-15 13:31:36,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2023-02-15 13:31:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 23 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:31:36,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:31:55,277 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:32:43,559 WARN L233 SmtUtils]: Spent 10.10s on a formula simplification. DAG size of input: 68 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:32:44,507 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:32:44,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636298243] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:32:44,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:32:44,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 21] total 53 [2023-02-15 13:32:44,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876826498] [2023-02-15 13:32:44,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:32:44,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 13:32:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:32:44,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 13:32:44,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2686, Unknown=4, NotChecked=0, Total=2862 [2023-02-15 13:32:44,511 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 54 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 54 states have internal predecessors, (111), 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:32:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:32:50,845 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2023-02-15 13:32:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 13:32:50,845 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 54 states have internal predecessors, (111), 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:32:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:32:50,846 INFO L225 Difference]: With dead ends: 109 [2023-02-15 13:32:50,846 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 13:32:50,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=1059, Invalid=5909, Unknown=4, NotChecked=0, Total=6972 [2023-02-15 13:32:50,851 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 929 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:32:50,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 524 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-15 13:32:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 13:32:50,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 73. [2023-02-15 13:32:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.253968253968254) internal successors, (79), 72 states have internal predecessors, (79), 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:32:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2023-02-15 13:32:50,857 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 43 [2023-02-15 13:32:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:32:50,857 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2023-02-15 13:32:50,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 54 states have internal predecessors, (111), 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:32:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2023-02-15 13:32:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:32:50,858 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:32:50,859 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:32:50,864 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:32:51,064 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:32:51,065 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 13:32:51,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:32:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728483, now seen corresponding path program 2 times [2023-02-15 13:32:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:32:51,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332730137] [2023-02-15 13:32:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:32:51,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:32:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:32:52,490 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:32:52,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:32:52,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332730137] [2023-02-15 13:32:52,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332730137] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:32:52,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132184728] [2023-02-15 13:32:52,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:32:52,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:32:52,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:32:52,492 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:32:52,493 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:32:52,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:32:52,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:32:52,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 102 conjunts are in the unsatisfiable core [2023-02-15 13:32:52,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:32:52,682 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:32:52,786 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:32:52,787 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:32:52,795 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:32:52,795 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 11 treesize of output 11 [2023-02-15 13:32:52,861 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:32:52,864 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:32:52,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:32:52,898 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:32:52,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:32:52,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-02-15 13:32:52,975 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:32:52,975 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:32:53,070 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:32:53,071 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 37 treesize of output 32 [2023-02-15 13:32:53,077 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-15 13:32:53,078 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:32:53,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:32:53,162 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:32:53,162 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:32:53,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:32:53,198 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 13:32:53,199 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:32:53,335 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-15 13:32:53,335 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 80 [2023-02-15 13:32:53,353 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 13:32:53,353 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:32:53,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:32:53,907 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-15 13:32:53,911 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 151 treesize of output 151 [2023-02-15 13:32:53,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:32:53,920 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-15 13:32:53,920 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 144 treesize of output 115 [2023-02-15 13:32:54,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:32:54,472 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 13:32:54,472 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 100 treesize of output 76 [2023-02-15 13:32:54,492 INFO L321 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2023-02-15 13:32:54,492 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 83 treesize of output 80 [2023-02-15 13:32:54,568 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:32:54,589 INFO L321 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2023-02-15 13:32:54,589 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 133 treesize of output 94 [2023-02-15 13:32:54,619 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2023-02-15 13:32:54,620 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 76 treesize of output 66 [2023-02-15 13:32:54,904 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:32:54,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:32:59,088 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:33:00,110 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:33:00,202 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:33:12,091 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 327 treesize of output 317 [2023-02-15 13:33:14,034 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:14,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132184728] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:33:14,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:33:14,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 58 [2023-02-15 13:33:14,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783114010] [2023-02-15 13:33:14,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:33:14,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-02-15 13:33:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:33:14,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-02-15 13:33:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=3189, Unknown=0, NotChecked=0, Total=3422 [2023-02-15 13:33:14,036 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 59 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 59 states have internal predecessors, (117), 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:34:05,179 WARN L233 SmtUtils]: Spent 42.70s on a formula simplification. DAG size of input: 291 DAG size of output: 169 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:35:09,760 WARN L233 SmtUtils]: Spent 50.14s on a formula simplification. DAG size of input: 333 DAG size of output: 196 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:35:12,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]