./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_equal.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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:29:41,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:29:41,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:29:41,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:29:41,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:29:41,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:29:41,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:29:41,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:29:41,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:29:41,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:29:41,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:29:41,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:29:41,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:29:41,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:29:41,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:29:41,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:29:41,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:29:41,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:29:41,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:29:41,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:29:41,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:29:41,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:29:41,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:29:41,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:29:41,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:29:41,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:29:41,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:29:41,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:29:41,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:29:41,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:29:41,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:29:41,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:29:41,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:29:41,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:29:41,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:29:41,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:29:41,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:29:41,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:29:41,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:29:41,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:29:41,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:29:41,590 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:29:41,608 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:29:41,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:29:41,609 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:29:41,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:29:41,610 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:29:41,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:29:41,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:29:41,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:29:41,612 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:29:41,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:29:41,612 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:29:41,612 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:29:41,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:29:41,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:29:41,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:29:41,613 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:29:41,614 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:29:41,614 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:29:41,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:29:41,614 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:29:41,614 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:29:41,615 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:29:41,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:29:41,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:29:41,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:29:41,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:29:41,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:29:41,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:29:41,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:29:41,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:29:41,616 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:29:41,617 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:29:41,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:29:41,617 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:29:41,617 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2023-02-15 22:29:41,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:29:41,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:29:41,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:29:41,855 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:29:41,856 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:29:41,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-02-15 22:29:43,126 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:29:43,403 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:29:43,404 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-02-15 22:29:43,417 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823861bae/7a4f41791a20490d87f77e7ed927bb3e/FLAG529a33adc [2023-02-15 22:29:43,435 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823861bae/7a4f41791a20490d87f77e7ed927bb3e [2023-02-15 22:29:43,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:29:43,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:29:43,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:29:43,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:29:43,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:29:43,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:29:43" (1/1) ... [2023-02-15 22:29:43,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e6ae7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:29:43, skipping insertion in model container [2023-02-15 22:29:43,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:29:43" (1/1) ... [2023-02-15 22:29:43,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:29:43,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:29:43,772 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2023-02-15 22:29:43,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:29:43,792 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:29:43,831 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2023-02-15 22:29:43,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:29:43,857 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:29:43,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:29:43 WrapperNode [2023-02-15 22:29:43,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:29:43,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:29:43,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:29:43,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:29:43,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:29:43" (1/1) ... [2023-02-15 22:29:43,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:29:43" (1/1) ... [2023-02-15 22:29:43,899 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2023-02-15 22:29:43,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:29:43,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:29:43,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:29:43,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:29:43,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:29:43" (1/1) ... [2023-02-15 22:29:43,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:29:43" (1/1) ... [2023-02-15 22:29:43,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:29:43" (1/1) ... [2023-02-15 22:29:43,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:29:43" (1/1) ... [2023-02-15 22:29:43,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:29:43" (1/1) ... [2023-02-15 22:29:43,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:29:43" (1/1) ... [2023-02-15 22:29:43,930 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:29:43" (1/1) ... [2023-02-15 22:29:43,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:29:43" (1/1) ... [2023-02-15 22:29:43,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:29:43,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:29:43,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:29:43,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:29:43,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:29:43" (1/1) ... [2023-02-15 22:29:43,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:29:43,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:43,977 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 22:29:43,979 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 22:29:44,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:29:44,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:29:44,009 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 22:29:44,009 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 22:29:44,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:29:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:29:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 22:29:44,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:29:44,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:29:44,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:29:44,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 22:29:44,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:29:44,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:29:44,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:29:44,161 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:29:44,163 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:29:44,456 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:29:44,463 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:29:44,463 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 22:29:44,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:29:44 BoogieIcfgContainer [2023-02-15 22:29:44,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:29:44,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:29:44,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:29:44,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:29:44,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:29:43" (1/3) ... [2023-02-15 22:29:44,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7387113b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:29:44, skipping insertion in model container [2023-02-15 22:29:44,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:29:43" (2/3) ... [2023-02-15 22:29:44,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7387113b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:29:44, skipping insertion in model container [2023-02-15 22:29:44,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:29:44" (3/3) ... [2023-02-15 22:29:44,476 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2023-02-15 22:29:44,493 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:29:44,494 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-02-15 22:29:44,571 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:29:44,578 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;@37009b1d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:29:44,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-02-15 22:29:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 78 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:44,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 22:29:44,592 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:44,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:44,593 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:44,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1813843193, now seen corresponding path program 1 times [2023-02-15 22:29:44,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:44,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366262031] [2023-02-15 22:29:44,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:44,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:44,912 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 22:29:44,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:44,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366262031] [2023-02-15 22:29:44,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366262031] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:44,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:29:44,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:29:44,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749485207] [2023-02-15 22:29:44,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:44,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:29:44,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:44,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:29:44,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:29:44,955 INFO L87 Difference]: Start difference. First operand has 82 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 78 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:29:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:45,064 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2023-02-15 22:29:45,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:29:45,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 22:29:45,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:45,074 INFO L225 Difference]: With dead ends: 80 [2023-02-15 22:29:45,074 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 22:29:45,076 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 22:29:45,080 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:45,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 126 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:29:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 22:29:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-15 22:29:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-15 22:29:45,113 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 7 [2023-02-15 22:29:45,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:45,114 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-15 22:29:45,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:29:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-15 22:29:45,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 22:29:45,114 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:45,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:45,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:29:45,115 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:45,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1813843194, now seen corresponding path program 1 times [2023-02-15 22:29:45,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:45,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464713170] [2023-02-15 22:29:45,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:45,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:45,289 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 22:29:45,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:45,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464713170] [2023-02-15 22:29:45,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464713170] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:45,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:29:45,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:29:45,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421232802] [2023-02-15 22:29:45,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:45,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:29:45,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:45,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:29:45,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:29:45,294 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:29:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:45,369 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2023-02-15 22:29:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:29:45,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 22:29:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:45,371 INFO L225 Difference]: With dead ends: 75 [2023-02-15 22:29:45,371 INFO L226 Difference]: Without dead ends: 75 [2023-02-15 22:29:45,371 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 22:29:45,373 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:45,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:29:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-15 22:29:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-02-15 22:29:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.711111111111111) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2023-02-15 22:29:45,386 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 7 [2023-02-15 22:29:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:45,386 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2023-02-15 22:29:45,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:29:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2023-02-15 22:29:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:29:45,387 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:45,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:45,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:29:45,389 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:45,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:45,390 INFO L85 PathProgramCache]: Analyzing trace with hash 649951808, now seen corresponding path program 1 times [2023-02-15 22:29:45,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:45,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178275301] [2023-02-15 22:29:45,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:45,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:45,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:45,577 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 22:29:45,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:45,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178275301] [2023-02-15 22:29:45,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178275301] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:45,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:29:45,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:29:45,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185360405] [2023-02-15 22:29:45,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:45,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:29:45,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:45,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:29:45,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:29:45,581 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:29:45,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:45,805 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2023-02-15 22:29:45,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:29:45,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-15 22:29:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:45,811 INFO L225 Difference]: With dead ends: 79 [2023-02-15 22:29:45,811 INFO L226 Difference]: Without dead ends: 79 [2023-02-15 22:29:45,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:29:45,818 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 11 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:45,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:29:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-15 22:29:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2023-02-15 22:29:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-02-15 22:29:45,838 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 13 [2023-02-15 22:29:45,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:45,838 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-02-15 22:29:45,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:29:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-02-15 22:29:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:29:45,841 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:45,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:45,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:29:45,842 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:45,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:45,843 INFO L85 PathProgramCache]: Analyzing trace with hash 649951809, now seen corresponding path program 1 times [2023-02-15 22:29:45,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:45,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615829029] [2023-02-15 22:29:45,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:45,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:45,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:46,098 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 22:29:46,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:46,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615829029] [2023-02-15 22:29:46,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615829029] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:46,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:29:46,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:29:46,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025211550] [2023-02-15 22:29:46,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:46,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:29:46,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:46,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:29:46,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:29:46,103 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:29:46,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:46,268 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2023-02-15 22:29:46,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:29:46,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-15 22:29:46,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:46,271 INFO L225 Difference]: With dead ends: 78 [2023-02-15 22:29:46,271 INFO L226 Difference]: Without dead ends: 78 [2023-02-15 22:29:46,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:29:46,280 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 9 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:46,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 309 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:29:46,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-15 22:29:46,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2023-02-15 22:29:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 69 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2023-02-15 22:29:46,298 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 13 [2023-02-15 22:29:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:46,299 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2023-02-15 22:29:46,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:29:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2023-02-15 22:29:46,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:29:46,300 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:46,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:46,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:29:46,300 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:46,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash 87749440, now seen corresponding path program 1 times [2023-02-15 22:29:46,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:46,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784857451] [2023-02-15 22:29:46,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:46,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:46,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 22:29:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:46,400 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 22:29:46,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:46,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784857451] [2023-02-15 22:29:46,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784857451] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:46,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:29:46,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:29:46,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880359103] [2023-02-15 22:29:46,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:46,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:29:46,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:46,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:29:46,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:29:46,404 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:29:46,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:46,473 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2023-02-15 22:29:46,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:29:46,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-15 22:29:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:46,475 INFO L225 Difference]: With dead ends: 79 [2023-02-15 22:29:46,475 INFO L226 Difference]: Without dead ends: 79 [2023-02-15 22:29:46,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:29:46,476 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:46,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 186 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:29:46,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-15 22:29:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2023-02-15 22:29:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-02-15 22:29:46,494 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 15 [2023-02-15 22:29:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:46,495 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-02-15 22:29:46,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:29:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-02-15 22:29:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 22:29:46,496 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:46,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:46,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:29:46,497 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash -847170750, now seen corresponding path program 1 times [2023-02-15 22:29:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:46,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172551775] [2023-02-15 22:29:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:46,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:29:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:29:46,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:46,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172551775] [2023-02-15 22:29:46,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172551775] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:46,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770713401] [2023-02-15 22:29:46,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:46,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:46,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:46,639 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 22:29:46,641 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 22:29:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:46,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:29:46,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:29:46,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:29:46,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770713401] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:29:46,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:29:46,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-15 22:29:46,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086321224] [2023-02-15 22:29:46,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:46,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:29:46,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:46,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:29:46,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:29:46,893 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:29:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:46,969 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2023-02-15 22:29:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:29:46,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2023-02-15 22:29:46,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:46,971 INFO L225 Difference]: With dead ends: 80 [2023-02-15 22:29:46,971 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 22:29:46,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:29:46,972 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:46,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 255 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:29:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 22:29:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-15 22:29:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.588235294117647) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2023-02-15 22:29:46,978 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 28 [2023-02-15 22:29:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:46,978 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2023-02-15 22:29:46,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:29:46,979 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2023-02-15 22:29:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:29:46,979 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:46,979 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:46,989 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 22:29:47,180 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 22:29:47,181 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:47,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:47,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1562281600, now seen corresponding path program 2 times [2023-02-15 22:29:47,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:47,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153367070] [2023-02-15 22:29:47,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:47,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:47,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:47,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:47,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 22:29:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:47,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153367070] [2023-02-15 22:29:47,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153367070] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:47,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:29:47,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:29:47,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900698901] [2023-02-15 22:29:47,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:47,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:29:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:47,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:29:47,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:29:47,778 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:47,907 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2023-02-15 22:29:47,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:29:47,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2023-02-15 22:29:47,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:47,909 INFO L225 Difference]: With dead ends: 88 [2023-02-15 22:29:47,909 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 22:29:47,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:29:47,910 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 106 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:47,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 136 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:29:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 22:29:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2023-02-15 22:29:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 71 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2023-02-15 22:29:47,914 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 41 [2023-02-15 22:29:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:47,921 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2023-02-15 22:29:47,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2023-02-15 22:29:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:29:47,924 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:47,925 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:47,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:29:47,925 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:47,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:47,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1562281601, now seen corresponding path program 1 times [2023-02-15 22:29:47,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:47,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858290569] [2023-02-15 22:29:47,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:47,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:48,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:48,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:48,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:29:48,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:48,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858290569] [2023-02-15 22:29:48,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858290569] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:48,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839621053] [2023-02-15 22:29:48,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:48,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:48,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:48,629 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 22:29:48,632 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 22:29:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:48,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 22:29:48,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:48,812 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 22:29:48,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:29:48,872 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:29:48,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:48,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:29:48,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:29:48,992 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_453 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:29:49,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:49,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:29:49,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:29:49,130 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_454 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454))))) is different from true [2023-02-15 22:29:49,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:49,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:29:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2023-02-15 22:29:49,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:51,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839621053] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:51,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:51,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-02-15 22:29:51,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028731218] [2023-02-15 22:29:51,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:51,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 22:29:51,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:51,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 22:29:51,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=192, Unknown=3, NotChecked=90, Total=342 [2023-02-15 22:29:51,311 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 17 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:29:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:51,575 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2023-02-15 22:29:51,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:29:51,576 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2023-02-15 22:29:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:51,577 INFO L225 Difference]: With dead ends: 84 [2023-02-15 22:29:51,577 INFO L226 Difference]: Without dead ends: 84 [2023-02-15 22:29:51,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=81, Invalid=234, Unknown=3, NotChecked=102, Total=420 [2023-02-15 22:29:51,578 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 220 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:51,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 189 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 223 Invalid, 0 Unknown, 237 Unchecked, 0.2s Time] [2023-02-15 22:29:51,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-15 22:29:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2023-02-15 22:29:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2023-02-15 22:29:51,581 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 41 [2023-02-15 22:29:51,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:51,582 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2023-02-15 22:29:51,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:29:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2023-02-15 22:29:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 22:29:51,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:51,583 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:51,592 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 22:29:51,790 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,SelfDestructingSolverStorable7 [2023-02-15 22:29:51,790 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:51,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:51,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1665526433, now seen corresponding path program 1 times [2023-02-15 22:29:51,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:51,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858499208] [2023-02-15 22:29:51,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:51,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:52,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:52,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:52,426 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:29:52,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:52,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858499208] [2023-02-15 22:29:52,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858499208] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:52,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201396653] [2023-02-15 22:29:52,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:52,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:52,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:52,429 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 22:29:52,431 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 22:29:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:52,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 22:29:52,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:52,765 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 9 treesize of output 5 [2023-02-15 22:29:52,861 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_614 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_614))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:29:52,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:52,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:29:52,896 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 22:29:52,897 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 16 treesize of output 18 [2023-02-15 22:29:52,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:29:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 22:29:52,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:29:52,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201396653] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:52,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:29:52,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2023-02-15 22:29:52,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485633948] [2023-02-15 22:29:52,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:52,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:29:52,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:52,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:29:52,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2023-02-15 22:29:52,973 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:53,281 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2023-02-15 22:29:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:29:53,281 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2023-02-15 22:29:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:53,282 INFO L225 Difference]: With dead ends: 112 [2023-02-15 22:29:53,282 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 22:29:53,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2023-02-15 22:29:53,283 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 73 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:53,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 298 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 3 Unknown, 132 Unchecked, 0.2s Time] [2023-02-15 22:29:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 22:29:53,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 74. [2023-02-15 22:29:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 69 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2023-02-15 22:29:53,286 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 44 [2023-02-15 22:29:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:53,287 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-02-15 22:29:53,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:53,287 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2023-02-15 22:29:53,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 22:29:53,287 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:53,287 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:53,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 22:29:53,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:53,494 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:53,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:53,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1665526434, now seen corresponding path program 1 times [2023-02-15 22:29:53,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:53,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276080006] [2023-02-15 22:29:53,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:53,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:54,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:54,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:54,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:29:54,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:54,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276080006] [2023-02-15 22:29:54,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276080006] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:54,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851631852] [2023-02-15 22:29:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:54,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:54,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:54,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:29:54,469 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 22:29:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:54,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-15 22:29:54,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:54,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-02-15 22:29:54,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-15 22:29:55,024 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_772 (Array Int Int))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_772)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_773)))) is different from true [2023-02-15 22:29:55,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:55,072 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 31 [2023-02-15 22:29:55,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:55,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-02-15 22:29:55,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:55,094 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 31 [2023-02-15 22:29:55,102 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:29:55,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:29:55,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-15 22:29:55,153 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 28 treesize of output 16 [2023-02-15 22:29:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 22:29:55,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:29:55,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851631852] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:55,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:29:55,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 27 [2023-02-15 22:29:55,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775152765] [2023-02-15 22:29:55,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:55,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:29:55,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:55,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:29:55,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=630, Unknown=1, NotChecked=50, Total=756 [2023-02-15 22:29:55,218 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:55,705 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2023-02-15 22:29:55,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:29:55,706 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2023-02-15 22:29:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:55,707 INFO L225 Difference]: With dead ends: 113 [2023-02-15 22:29:55,707 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 22:29:55,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=999, Unknown=1, NotChecked=64, Total=1190 [2023-02-15 22:29:55,708 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 167 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:55,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 321 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 377 Invalid, 0 Unknown, 107 Unchecked, 0.2s Time] [2023-02-15 22:29:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 22:29:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 74. [2023-02-15 22:29:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 69 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2023-02-15 22:29:55,711 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 44 [2023-02-15 22:29:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:55,711 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2023-02-15 22:29:55,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2023-02-15 22:29:55,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:29:55,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:55,712 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:55,720 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 22:29:55,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:55,912 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:55,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:55,913 INFO L85 PathProgramCache]: Analyzing trace with hash 91710248, now seen corresponding path program 1 times [2023-02-15 22:29:55,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:55,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282598439] [2023-02-15 22:29:55,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:55,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:55,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 22:29:56,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:56,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282598439] [2023-02-15 22:29:56,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282598439] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:56,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:29:56,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:29:56,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425152299] [2023-02-15 22:29:56,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:56,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:29:56,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:56,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:29:56,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:29:56,018 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:29:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:56,063 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2023-02-15 22:29:56,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:29:56,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-02-15 22:29:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:56,066 INFO L225 Difference]: With dead ends: 109 [2023-02-15 22:29:56,066 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 22:29:56,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:29:56,067 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 38 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:56,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:29:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 22:29:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2023-02-15 22:29:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 70 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2023-02-15 22:29:56,070 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 45 [2023-02-15 22:29:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:56,070 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2023-02-15 22:29:56,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:29:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2023-02-15 22:29:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:29:56,074 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:56,074 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:56,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 22:29:56,074 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1451944619, now seen corresponding path program 1 times [2023-02-15 22:29:56,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:56,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96165567] [2023-02-15 22:29:56,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:56,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:29:56,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:56,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96165567] [2023-02-15 22:29:56,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96165567] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:56,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:29:56,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:29:56,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379165805] [2023-02-15 22:29:56,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:56,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:29:56,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:56,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:29:56,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:29:56,232 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:29:56,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:56,336 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2023-02-15 22:29:56,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:29:56,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2023-02-15 22:29:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:56,337 INFO L225 Difference]: With dead ends: 86 [2023-02-15 22:29:56,337 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 22:29:56,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:29:56,338 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 44 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:56,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 207 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:29:56,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 22:29:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2023-02-15 22:29:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 69 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2023-02-15 22:29:56,340 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 46 [2023-02-15 22:29:56,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:56,340 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2023-02-15 22:29:56,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:29:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2023-02-15 22:29:56,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:29:56,341 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:56,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:56,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 22:29:56,341 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:56,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1451944618, now seen corresponding path program 1 times [2023-02-15 22:29:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:56,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770822475] [2023-02-15 22:29:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 22:29:56,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:56,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770822475] [2023-02-15 22:29:56,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770822475] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:56,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:29:56,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:29:56,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901912682] [2023-02-15 22:29:56,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:56,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:29:56,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:56,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:29:56,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:29:56,464 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:56,517 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2023-02-15 22:29:56,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:29:56,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2023-02-15 22:29:56,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:56,519 INFO L225 Difference]: With dead ends: 73 [2023-02-15 22:29:56,519 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 22:29:56,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:29:56,520 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 56 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:56,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 160 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:29:56,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 22:29:56,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-15 22:29:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 68 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2023-02-15 22:29:56,523 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 46 [2023-02-15 22:29:56,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:56,523 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2023-02-15 22:29:56,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:56,523 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2023-02-15 22:29:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 22:29:56,524 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:56,525 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:56,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 22:29:56,525 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:56,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:56,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2059192403, now seen corresponding path program 1 times [2023-02-15 22:29:56,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:56,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354522890] [2023-02-15 22:29:56,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:56,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 22:29:56,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:56,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354522890] [2023-02-15 22:29:56,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354522890] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:56,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:29:56,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:29:56,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277686225] [2023-02-15 22:29:56,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:56,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:29:56,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:56,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:29:56,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:29:56,678 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:56,731 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2023-02-15 22:29:56,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:29:56,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2023-02-15 22:29:56,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:56,732 INFO L225 Difference]: With dead ends: 70 [2023-02-15 22:29:56,732 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 22:29:56,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:29:56,733 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 91 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:56,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 138 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:29:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 22:29:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-15 22:29:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2023-02-15 22:29:56,736 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 47 [2023-02-15 22:29:56,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:56,736 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2023-02-15 22:29:56,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:29:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2023-02-15 22:29:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 22:29:56,738 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:56,738 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:56,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 22:29:56,738 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:56,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:56,739 INFO L85 PathProgramCache]: Analyzing trace with hash 589543324, now seen corresponding path program 1 times [2023-02-15 22:29:56,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:56,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681407484] [2023-02-15 22:29:56,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:56,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 22:29:56,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:56,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681407484] [2023-02-15 22:29:56,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681407484] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:56,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:29:56,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:29:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499235534] [2023-02-15 22:29:56,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:56,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:29:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:56,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:29:56,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:29:56,822 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:29:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:56,891 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2023-02-15 22:29:56,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:29:56,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2023-02-15 22:29:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:56,892 INFO L225 Difference]: With dead ends: 81 [2023-02-15 22:29:56,893 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 22:29:56,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:29:56,893 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 37 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:56,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 140 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:29:56,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 22:29:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2023-02-15 22:29:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 64 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2023-02-15 22:29:56,896 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 48 [2023-02-15 22:29:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:56,897 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2023-02-15 22:29:56,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:29:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2023-02-15 22:29:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 22:29:56,897 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:56,897 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:56,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 22:29:56,898 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:56,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash 589543325, now seen corresponding path program 1 times [2023-02-15 22:29:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:56,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241870333] [2023-02-15 22:29:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:56,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:57,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:57,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:57,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:29:57,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:57,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241870333] [2023-02-15 22:29:57,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241870333] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:57,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571465587] [2023-02-15 22:29:57,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:57,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:57,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:57,418 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 22:29:57,444 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 22:29:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:57,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:29:57,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 22:29:57,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:29:57,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571465587] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:57,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:29:57,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [18] total 20 [2023-02-15 22:29:57,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563321275] [2023-02-15 22:29:57,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:57,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:29:57,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:57,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:29:57,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2023-02-15 22:29:57,662 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:29:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:57,736 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2023-02-15 22:29:57,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:29:57,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2023-02-15 22:29:57,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:57,737 INFO L225 Difference]: With dead ends: 68 [2023-02-15 22:29:57,737 INFO L226 Difference]: Without dead ends: 68 [2023-02-15 22:29:57,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2023-02-15 22:29:57,738 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 39 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:57,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 111 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:29:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-02-15 22:29:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-02-15 22:29:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2023-02-15 22:29:57,742 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 48 [2023-02-15 22:29:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:57,743 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2023-02-15 22:29:57,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:29:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2023-02-15 22:29:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:29:57,743 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:57,744 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:57,752 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 22:29:57,950 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,SelfDestructingSolverStorable15 [2023-02-15 22:29:57,950 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:57,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1095973890, now seen corresponding path program 1 times [2023-02-15 22:29:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:57,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042391719] [2023-02-15 22:29:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:58,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:58,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:58,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:29:58,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:58,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042391719] [2023-02-15 22:29:58,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042391719] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:58,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:29:58,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:29:58,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426528420] [2023-02-15 22:29:58,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:58,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:29:58,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:58,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:29:58,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:29:58,187 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:29:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:58,284 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2023-02-15 22:29:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:29:58,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2023-02-15 22:29:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:58,285 INFO L225 Difference]: With dead ends: 67 [2023-02-15 22:29:58,285 INFO L226 Difference]: Without dead ends: 67 [2023-02-15 22:29:58,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:29:58,286 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:58,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 206 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:29:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-15 22:29:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-02-15 22:29:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 62 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2023-02-15 22:29:58,288 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 49 [2023-02-15 22:29:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:58,288 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2023-02-15 22:29:58,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:29:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2023-02-15 22:29:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 22:29:58,289 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:58,289 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:58,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 22:29:58,289 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:29:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash 15214980, now seen corresponding path program 1 times [2023-02-15 22:29:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:58,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044445893] [2023-02-15 22:29:58,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:58,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:58,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:58,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:58,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:29:59,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:59,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044445893] [2023-02-15 22:29:59,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044445893] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:59,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947496042] [2023-02-15 22:29:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:59,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:59,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:59,068 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 22:29:59,071 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 22:29:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:59,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-15 22:29:59,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:59,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 22:29:59,621 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1712 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1712))) (exists ((v_ArrVal_1713 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1713))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-15 22:29:59,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:59,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:29:59,650 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:29:59,650 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 16 treesize of output 26 [2023-02-15 22:29:59,791 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:29:59,795 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 36 [2023-02-15 22:29:59,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:59,889 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 22:29:59,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2023-02-15 22:29:59,910 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 22:29:59,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:30:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:30:00,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:30:00,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947496042] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:30:00,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:30:00,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [23] total 35 [2023-02-15 22:30:00,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554211000] [2023-02-15 22:30:00,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:30:00,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 22:30:00,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:00,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 22:30:00,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1077, Unknown=23, NotChecked=66, Total=1260 [2023-02-15 22:30:00,015 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:30:00,084 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1712 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1712))) (exists ((v_ArrVal_1713 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1713))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1712 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1712))) (exists ((v_ArrVal_1713 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1713))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-15 22:30:02,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:30:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:02,503 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2023-02-15 22:30:02,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 22:30:02,503 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2023-02-15 22:30:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:02,504 INFO L225 Difference]: With dead ends: 99 [2023-02-15 22:30:02,504 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 22:30:02,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=140, Invalid=1484, Unknown=24, NotChecked=158, Total=1806 [2023-02-15 22:30:02,505 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 132 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 7 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:02,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 363 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 443 Invalid, 31 Unknown, 110 Unchecked, 2.3s Time] [2023-02-15 22:30:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 22:30:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2023-02-15 22:30:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:30:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2023-02-15 22:30:02,508 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 54 [2023-02-15 22:30:02,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:02,508 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2023-02-15 22:30:02,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:30:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2023-02-15 22:30:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 22:30:02,509 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:02,509 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:30:02,518 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 22:30:02,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 22:30:02,710 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:30:02,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:02,710 INFO L85 PathProgramCache]: Analyzing trace with hash 15214981, now seen corresponding path program 1 times [2023-02-15 22:30:02,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:02,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893752765] [2023-02-15 22:30:02,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:02,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:03,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:30:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:03,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:30:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:03,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:30:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:30:04,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:04,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893752765] [2023-02-15 22:30:04,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893752765] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:04,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468049396] [2023-02-15 22:30:04,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:04,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:04,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:04,162 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 22:30:04,165 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 22:30:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:04,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 84 conjunts are in the unsatisfiable core [2023-02-15 22:30:04,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:04,436 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 22:30:04,443 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 22:30:04,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 22:30:04,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:30:04,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:30:04,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:30:05,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:05,140 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 36 treesize of output 27 [2023-02-15 22:30:05,153 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:30:05,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:30:05,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-02-15 22:30:05,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:05,176 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 16 treesize of output 11 [2023-02-15 22:30:05,558 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:30:05,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2023-02-15 22:30:05,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:05,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 22:30:05,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:05,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:30:05,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:05,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-02-15 22:30:05,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 22:30:05,703 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 22:30:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:30:05,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:05,945 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1905 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1905 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 22:30:06,155 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1903 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1904) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 22:30:06,328 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (and (forall ((v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1903 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1903) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1903) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1904) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-15 22:30:06,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468049396] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:06,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:30:06,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 43 [2023-02-15 22:30:06,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458327384] [2023-02-15 22:30:06,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:06,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 22:30:06,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:06,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 22:30:06,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2310, Unknown=68, NotChecked=300, Total=2862 [2023-02-15 22:30:06,742 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 44 states, 41 states have (on average 2.073170731707317) internal successors, (85), 38 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:30:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:09,250 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2023-02-15 22:30:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 22:30:09,251 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.073170731707317) internal successors, (85), 38 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2023-02-15 22:30:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:09,252 INFO L225 Difference]: With dead ends: 145 [2023-02-15 22:30:09,252 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 22:30:09,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=452, Invalid=4320, Unknown=70, NotChecked=414, Total=5256 [2023-02-15 22:30:09,254 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 677 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:09,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 750 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 22:30:09,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 22:30:09,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 76. [2023-02-15 22:30:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 71 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:30:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-02-15 22:30:09,258 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 54 [2023-02-15 22:30:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:09,259 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-02-15 22:30:09,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.073170731707317) internal successors, (85), 38 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:30:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-02-15 22:30:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 22:30:09,260 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:09,260 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:30:09,272 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 22:30:09,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:09,468 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:30:09,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:09,469 INFO L85 PathProgramCache]: Analyzing trace with hash 281883173, now seen corresponding path program 1 times [2023-02-15 22:30:09,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:09,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015365626] [2023-02-15 22:30:09,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:09,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:09,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:30:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:09,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:30:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:09,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:30:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:30:09,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:09,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015365626] [2023-02-15 22:30:09,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015365626] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:09,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309523006] [2023-02-15 22:30:09,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:09,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:09,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:09,958 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 22:30:09,967 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 22:30:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:10,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 22:30:10,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:10,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:30:10,239 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2097 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2097))) (not (= 0 |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:30:10,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:30:10,285 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2098 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2098))) (not (= 0 |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:30:10,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:30:10,339 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2099 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2099))) (not (= 0 |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:30:10,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:30:10,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:30:10,410 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:30:10,411 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 22:30:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2023-02-15 22:30:10,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:10,509 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 19 treesize of output 11 [2023-02-15 22:30:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 22:30:10,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309523006] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:30:10,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:30:10,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 7] total 30 [2023-02-15 22:30:10,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293942048] [2023-02-15 22:30:10,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:10,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 22:30:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:10,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 22:30:10,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=623, Unknown=3, NotChecked=156, Total=870 [2023-02-15 22:30:10,952 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 30 states, 29 states have (on average 3.586206896551724) internal successors, (104), 27 states have internal predecessors, (104), 4 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 22:30:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:11,664 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2023-02-15 22:30:11,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 22:30:11,665 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.586206896551724) internal successors, (104), 27 states have internal predecessors, (104), 4 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 54 [2023-02-15 22:30:11,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:11,666 INFO L225 Difference]: With dead ends: 69 [2023-02-15 22:30:11,666 INFO L226 Difference]: Without dead ends: 69 [2023-02-15 22:30:11,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 90 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=334, Invalid=1567, Unknown=3, NotChecked=258, Total=2162 [2023-02-15 22:30:11,667 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 344 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:11,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 342 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 526 Invalid, 0 Unknown, 186 Unchecked, 0.3s Time] [2023-02-15 22:30:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-15 22:30:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-02-15 22:30:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 64 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:30:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2023-02-15 22:30:11,670 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 54 [2023-02-15 22:30:11,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:11,670 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2023-02-15 22:30:11,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.586206896551724) internal successors, (104), 27 states have internal predecessors, (104), 4 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 22:30:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2023-02-15 22:30:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 22:30:11,671 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:11,672 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:30:11,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:30:11,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:11,879 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:30:11,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash 471663079, now seen corresponding path program 1 times [2023-02-15 22:30:11,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:11,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716945055] [2023-02-15 22:30:11,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:11,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:12,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:30:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:12,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:30:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:12,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:30:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:30:13,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:13,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716945055] [2023-02-15 22:30:13,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716945055] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:13,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886947103] [2023-02-15 22:30:13,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:13,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:13,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:13,026 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:30:13,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 22:30:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:13,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-15 22:30:13,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:13,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 22:30:13,700 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2287 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2287)))) is different from true [2023-02-15 22:30:13,706 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2288 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2288))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-15 22:30:13,713 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2288 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2288)))) is different from true [2023-02-15 22:30:13,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:13,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-15 22:30:14,055 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:30:14,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 22:30:14,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:14,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-15 22:30:14,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 22:30:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2023-02-15 22:30:14,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:14,202 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2290 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2290) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 22:30:14,576 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_20| Int) (v_ArrVal_2290 (Array Int Int)) (v_ArrVal_2289 (Array Int Int)) (v_ArrVal_2294 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_20| |c_#StackHeapBarrier|)) (not (= 0 (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_20| v_ArrVal_2294))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) v_ArrVal_2289)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_20| v_ArrVal_2290) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 22:30:14,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886947103] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:14,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:30:14,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 46 [2023-02-15 22:30:14,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166730865] [2023-02-15 22:30:14,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:14,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 22:30:14,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:14,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 22:30:14,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2057, Unknown=68, NotChecked=480, Total=2756 [2023-02-15 22:30:14,580 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 46 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 40 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:30:16,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:16,756 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2023-02-15 22:30:16,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 22:30:16,757 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 40 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2023-02-15 22:30:16,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:16,757 INFO L225 Difference]: With dead ends: 84 [2023-02-15 22:30:16,758 INFO L226 Difference]: Without dead ends: 84 [2023-02-15 22:30:16,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=504, Invalid=3869, Unknown=69, NotChecked=670, Total=5112 [2023-02-15 22:30:16,759 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 718 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:16,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 564 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 943 Invalid, 0 Unknown, 239 Unchecked, 0.5s Time] [2023-02-15 22:30:16,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-15 22:30:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2023-02-15 22:30:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:30:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2023-02-15 22:30:16,762 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 55 [2023-02-15 22:30:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:16,762 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2023-02-15 22:30:16,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 40 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:30:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2023-02-15 22:30:16,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 22:30:16,763 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:16,763 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:30:16,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 22:30:16,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:16,969 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:30:16,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:16,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1777907541, now seen corresponding path program 1 times [2023-02-15 22:30:16,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:16,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046652103] [2023-02-15 22:30:16,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:16,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:18,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:30:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:18,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:30:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:18,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:30:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:30:18,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:18,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046652103] [2023-02-15 22:30:18,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046652103] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:18,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381809245] [2023-02-15 22:30:18,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:18,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:18,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:18,657 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:30:18,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 22:30:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:18,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 118 conjunts are in the unsatisfiable core [2023-02-15 22:30:18,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:18,929 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 22:30:18,975 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 22:30:19,109 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 22:30:19,325 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 34 treesize of output 22 [2023-02-15 22:30:19,330 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 11 treesize of output 3 [2023-02-15 22:30:19,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:30:19,336 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 22:30:19,385 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 22:30:19,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:19,691 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 40 treesize of output 38 [2023-02-15 22:30:19,702 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:30:19,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:30:19,711 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 22 treesize of output 24 [2023-02-15 22:30:19,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:19,718 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 36 treesize of output 34 [2023-02-15 22:30:20,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:20,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 78 [2023-02-15 22:30:20,256 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 41 treesize of output 36 [2023-02-15 22:30:20,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:20,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2023-02-15 22:30:20,378 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:30:20,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 120 [2023-02-15 22:30:20,397 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:30:20,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 121 [2023-02-15 22:30:20,411 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 36 treesize of output 38 [2023-02-15 22:30:20,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:20,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:30:20,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 37 [2023-02-15 22:30:20,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-02-15 22:30:20,681 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 13 treesize of output 9 [2023-02-15 22:30:20,736 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 22:30:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:30:20,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:22,157 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 244 treesize of output 198 [2023-02-15 22:30:22,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381809245] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:22,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:30:22,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2023-02-15 22:30:22,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972136486] [2023-02-15 22:30:22,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:22,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 22:30:22,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:22,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 22:30:22,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3079, Unknown=19, NotChecked=0, Total=3306 [2023-02-15 22:30:22,719 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 47 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 41 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:30:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:25,075 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2023-02-15 22:30:25,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 22:30:25,076 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 41 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2023-02-15 22:30:25,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:25,076 INFO L225 Difference]: With dead ends: 82 [2023-02-15 22:30:25,077 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 22:30:25,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=521, Invalid=5620, Unknown=21, NotChecked=0, Total=6162 [2023-02-15 22:30:25,079 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 437 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:25,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 512 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1159 Invalid, 2 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 22:30:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 22:30:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2023-02-15 22:30:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:30:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2023-02-15 22:30:25,082 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 58 [2023-02-15 22:30:25,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:25,082 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2023-02-15 22:30:25,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 41 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:30:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2023-02-15 22:30:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 22:30:25,083 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:25,083 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:30:25,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 22:30:25,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 22:30:25,290 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:30:25,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:25,290 INFO L85 PathProgramCache]: Analyzing trace with hash 719441558, now seen corresponding path program 1 times [2023-02-15 22:30:25,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:25,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827311889] [2023-02-15 22:30:25,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:25,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:26,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:30:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:26,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:30:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:26,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:30:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:30:26,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:26,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827311889] [2023-02-15 22:30:26,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827311889] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:26,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582998197] [2023-02-15 22:30:26,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:26,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:26,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:26,909 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:30:26,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 22:30:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:27,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 97 conjunts are in the unsatisfiable core [2023-02-15 22:30:27,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:27,662 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 19 treesize of output 11 [2023-02-15 22:30:27,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:30:27,670 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 22:30:27,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:27,959 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 21 [2023-02-15 22:30:27,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:27,974 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 25 treesize of output 25 [2023-02-15 22:30:27,993 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 22:30:27,993 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 21 treesize of output 29 [2023-02-15 22:30:28,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:28,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 44 [2023-02-15 22:30:28,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:28,514 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 42 treesize of output 40 [2023-02-15 22:30:28,612 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:30:28,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 100 [2023-02-15 22:30:28,624 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:30:28,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 90 [2023-02-15 22:30:28,711 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 82 treesize of output 58 [2023-02-15 22:30:28,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:28,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:30:28,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 31 [2023-02-15 22:30:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:30:29,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:29,640 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2696 (Array Int Int)) (v_ArrVal_2695 (Array Int Int)) (v_ArrVal_2694 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2694) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2695) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= (+ .cse0 1) 0) (= (select |c_#valid| (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2696))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse0 4))) 1)))) is different from false [2023-02-15 22:30:29,963 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2696 (Array Int Int)) (v_ArrVal_2695 (Array Int Int)) (v_ArrVal_2694 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2694) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2695) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= (+ .cse0 1) 0) (= (select |c_#valid| (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2696))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse0 4))) 1))))) is different from false [2023-02-15 22:30:30,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582998197] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:30,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:30:30,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2023-02-15 22:30:30,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888291552] [2023-02-15 22:30:30,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:30,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 22:30:30,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:30,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 22:30:30,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3427, Unknown=48, NotChecked=238, Total=3906 [2023-02-15 22:30:30,174 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 48 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:30:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:33,524 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2023-02-15 22:30:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 22:30:33,524 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 48 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2023-02-15 22:30:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:33,525 INFO L225 Difference]: With dead ends: 105 [2023-02-15 22:30:33,525 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 22:30:33,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1501 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=711, Invalid=6053, Unknown=50, NotChecked=326, Total=7140 [2023-02-15 22:30:33,527 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 693 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:33,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 592 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1380 Invalid, 2 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 22:30:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 22:30:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2023-02-15 22:30:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:30:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2023-02-15 22:30:33,532 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 59 [2023-02-15 22:30:33,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:33,533 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2023-02-15 22:30:33,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 48 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:30:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2023-02-15 22:30:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 22:30:33,534 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:33,534 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:30:33,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 22:30:33,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-15 22:30:33,742 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:30:33,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:33,742 INFO L85 PathProgramCache]: Analyzing trace with hash 719441559, now seen corresponding path program 1 times [2023-02-15 22:30:33,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:33,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59441106] [2023-02-15 22:30:33,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:33,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:35,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:30:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:35,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:30:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:35,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:30:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:30:35,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:35,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59441106] [2023-02-15 22:30:35,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59441106] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:35,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804859574] [2023-02-15 22:30:35,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:35,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:35,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:35,581 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:30:35,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 22:30:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:35,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 117 conjunts are in the unsatisfiable core [2023-02-15 22:30:35,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:36,292 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 19 treesize of output 11 [2023-02-15 22:30:36,295 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 22:30:36,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:30:36,347 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 22:30:36,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:36,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-02-15 22:30:36,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:36,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-02-15 22:30:36,569 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:30:36,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:30:36,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:36,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2023-02-15 22:30:37,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:37,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2023-02-15 22:30:37,108 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:30:37,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 108 [2023-02-15 22:30:37,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:37,131 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 22:30:37,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 108 [2023-02-15 22:30:37,426 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:30:37,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:37,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:30:37,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 58 [2023-02-15 22:30:37,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:37,441 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 22:30:37,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 24 [2023-02-15 22:30:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:30:37,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:39,162 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse11 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|))) (.cse6 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)))) (and (forall ((v_ArrVal_2894 (Array Int Int))) (let ((.cse1 (store .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2894))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2893 (Array Int Int))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2893))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (let ((.cse3 (+ .cse0 4))) (<= (+ (select (select .cse1 .cse2) .cse3) 8) (select |c_#length| (select (select .cse4 .cse2) .cse3)))) (not (<= (+ .cse0 8) (select |c_#length| .cse2))))))))))) (forall ((v_ArrVal_2894 (Array Int Int))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2894))) (let ((.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2893 (Array Int Int))) (let ((.cse8 (select (select (store .cse5 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse7 .cse8) (+ .cse9 4)) 4)) (not (<= (+ .cse9 8) (select |c_#length| .cse8)))))) (not (<= 0 .cse9))))))))) is different from false [2023-02-15 22:30:39,275 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:30:39,276 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 1411 treesize of output 1652 [2023-02-15 22:30:44,470 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse8 (+ (select (select .cse6 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse9 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse2 (store .cse9 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse0 (select (select (store .cse9 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse0 .cse1) (not (= .cse1 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (forall ((v_prenex_36 (Array Int Int))) (let ((.cse5 (store (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (+ .cse4 4))) (or (= (select (select .cse2 .cse1) .cse3) .cse0) (not (<= .cse4 0)) (<= (select (select .cse5 .cse1) .cse3) 0) (not (<= 0 .cse4)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse20 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse19 (+ (select (select .cse17 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse12 (store .cse20 .cse18 (store (select .cse20 .cse18) .cse19 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse14 (select (select (store .cse12 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 0)))) (or (= (select (let ((.cse11 (store .cse12 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse13 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse14) (not (= .cse14 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (forall ((v_ArrVal_2894 (Array Int Int))) (let ((.cse16 (store .cse13 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse15)) (<= 0 (+ (select (select .cse16 .cse14) (+ .cse15 4)) 4)) (not (<= .cse15 0)))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse30 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse27 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse29 (+ (select (select .cse30 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse21 (store (store .cse30 .cse28 (store (select .cse30 .cse28) .cse29 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse24 (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2893 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse26 (store .cse27 .cse28 (store (select .cse27 .cse28) .cse29 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse25 (store .cse26 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse23 (+ .cse24 4)) (.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse21 .cse22) .cse23) (+ .cse24 1)) (= (select (select .cse25 .cse22) .cse23) (select (select (store .cse26 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse22 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))))) (not (<= 0 .cse24)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse37 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse41 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse38 (select (select .cse41 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse39 (+ (select (select .cse37 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse40 (store .cse41 .cse38 (store (select .cse41 .cse38) .cse39 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse36 (store .cse40 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse31 (select (select .cse36 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse31 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (forall ((v_ArrVal_2893 (Array Int Int))) (let ((.cse32 (select (select (store .cse40 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse32 .cse31) (forall ((v_prenex_36 (Array Int Int))) (let ((.cse33 (store (store .cse37 .cse38 (store (select .cse37 .cse38) .cse39 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse35 (select (select .cse33 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (+ .cse35 4))) (or (< (select (select .cse33 .cse31) .cse34) (+ .cse35 1)) (= (select (select .cse36 .cse31) .cse34) .cse32) (not (<= 0 .cse35))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse51 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse48 (select (select .cse51 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse49 (+ (select (select .cse47 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse50 (store .cse51 .cse48 (store (select .cse51 .cse48) .cse49 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse45 (store .cse50 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse43 (select (select (store .cse50 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse46 (select (select .cse45 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_36 (Array Int Int))) (let ((.cse44 (select (select (store (store .cse47 .cse48 (store (select .cse47 .cse48) .cse49 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse42 (select (select .cse45 .cse46) (+ .cse44 4)))) (or (= .cse42 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (= .cse42 .cse43) (not (<= .cse44 0)) (not (<= 0 .cse44)))))) (= .cse43 .cse46) (not (= .cse46 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse60 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse63 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse61 (select (select .cse63 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse62 (+ (select (select .cse60 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse58 (store .cse63 .cse61 (store (select .cse63 .cse61) .cse62 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse59 (store .cse58 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse53 (select (select .cse59 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse57 (store .cse60 .cse61 (store (select .cse60 .cse61) .cse62 0)))) (let ((.cse52 (select (select .cse59 .cse53) (+ (select (select (store .cse57 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse52 .cse53) (forall ((v_ArrVal_2893 (Array Int Int))) (let ((.cse54 (select (select (store .cse58 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse52 .cse54) (not (= .cse54 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (forall ((v_ArrVal_2894 (Array Int Int))) (let ((.cse56 (store .cse57 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894))) (let ((.cse55 (select (select .cse56 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse55)) (<= 0 (+ (select (select .cse56 .cse54) (+ .cse55 4)) 4)) (not (<= .cse55 0))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse74 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse71 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse72 (select (select .cse71 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse73 (+ (select (select .cse74 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse66 (store (store .cse74 .cse72 (store (select .cse74 .cse72) .cse73 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse70 (select (select .cse66 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2893 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse65 (store .cse71 .cse72 (store (select .cse71 .cse72) .cse73 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse69 (store .cse65 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse67 (select (select .cse69 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse68 (+ .cse70 4))) (let ((.cse64 (select (select .cse69 .cse67) .cse68))) (or (= .cse64 (select (select (store .cse65 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (<= (select (select .cse66 .cse67) .cse68) 0) (not (= .cse64 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (= .cse67 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))))))) (not (<= 0 .cse70)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse84 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse81 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse82 (select (select .cse81 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse83 (+ (select (select .cse84 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse80 (store (store .cse84 .cse82 (store (select .cse84 .cse82) .cse83 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse75 (select (select .cse80 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= .cse75 0)) (forall ((v_ArrVal_2893 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse79 (store .cse81 .cse82 (store (select .cse81 .cse82) .cse83 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse76 (store .cse79 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse77 (select (select .cse76 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse78 (+ .cse75 4))) (or (= (select (select .cse76 .cse77) .cse78) (select (select (store .cse79 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse77 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (<= (select (select .cse80 .cse77) .cse78) 0)))))) (not (<= 0 .cse75)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse91 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse88 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse89 (select (select .cse88 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse90 (+ (select (select .cse91 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse86 (store (store .cse91 .cse89 (store (select .cse91 .cse89) .cse90 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse87 (select (select .cse86 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_37 (Array Int Int))) (let ((.cse85 (select (select (store (store .cse88 .cse89 (store (select .cse88 .cse89) .cse90 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse85 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (<= (select (select .cse86 .cse85) (+ .cse87 4)) 0)))) (not (<= .cse87 0)) (not (<= 0 .cse87)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse100 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse97 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse98 (select (select .cse97 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse99 (+ (select (select .cse100 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse92 (store (store .cse100 .cse98 (store (select .cse100 .cse98) .cse99 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse95 (select (select .cse92 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_37 (Array Int Int))) (let ((.cse96 (store (store .cse97 .cse98 (store (select .cse97 .cse98) .cse99 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse94 (+ .cse95 4)) (.cse93 (select (select .cse96 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse92 .cse93) .cse94) (+ .cse95 1)) (= (select (select .cse96 .cse93) .cse94) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (= .cse93 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))))) (not (<= 0 .cse95)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse109 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse106 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse107 (select (select .cse106 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse108 (+ (select (select .cse109 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse102 (store (store .cse109 .cse107 (store (select .cse109 .cse107) .cse108 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse101 (select (select .cse102 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse101)) (forall ((v_prenex_37 (Array Int Int))) (let ((.cse105 (store (store .cse106 .cse107 (store (select .cse106 .cse107) .cse108 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse104 (+ .cse101 4)) (.cse103 (select (select .cse105 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse102 .cse103) .cse104) (+ .cse101 1)) (= (select (select .cse105 .cse103) .cse104) .cse103) (= .cse103 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse116 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse113 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse114 (select (select .cse113 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse115 (+ (select (select .cse116 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse112 (store (store .cse116 .cse114 (store (select .cse116 .cse114) .cse115 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894))) (let ((.cse111 (select (select (store (store .cse113 .cse114 (store (select .cse113 .cse114) .cse115 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse110 (select (select .cse112 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse110)) (not (= .cse111 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (<= 0 (+ (select (select .cse112 .cse111) (+ .cse110 4)) 4)) (not (<= .cse110 0)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse125 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse128 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse126 (select (select .cse128 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse127 (+ (select (select .cse125 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse122 (store .cse128 .cse126 (store (select .cse128 .cse126) .cse127 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse124 (store .cse122 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse118 (select (select .cse124 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse123 (store .cse125 .cse126 (store (select .cse125 .cse126) .cse127 0)))) (let ((.cse117 (select (select .cse124 .cse118) (+ (select (select (store .cse123 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse117 .cse118) (forall ((v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int))) (let ((.cse121 (store .cse123 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894))) (let ((.cse120 (select (select (store .cse122 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse119 (select (select .cse121 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse119)) (= .cse120 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (= .cse117 .cse120) (<= 0 (+ (select (select .cse121 .cse120) (+ .cse119 4)) 4)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse136 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse139 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse137 (select (select .cse139 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse138 (+ (select (select .cse136 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse133 (store .cse139 .cse137 (store (select .cse139 .cse137) .cse138 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse135 (store .cse133 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse134 (store .cse136 .cse137 (store (select .cse136 .cse137) .cse138 0))) (.cse131 (select (select .cse135 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2894 (Array Int Int))) (let ((.cse132 (store .cse134 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894))) (let ((.cse129 (select (select .cse132 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse129)) (forall ((v_ArrVal_2893 (Array Int Int))) (let ((.cse130 (select (select (store .cse133 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse130 .cse131) (not (= .cse130 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (<= 0 (+ (select (select .cse132 .cse130) (+ .cse129 4)) 4))))) (not (<= .cse129 0)))))) (= (select (select .cse135 .cse131) (+ (select (select (store .cse134 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse131)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse146 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse149 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse147 (select (select .cse149 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse148 (+ (select (select .cse146 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse143 (store .cse149 .cse147 (store (select .cse149 .cse147) .cse148 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse145 (store .cse143 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse141 (select (select .cse145 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse144 (select (select (store (store .cse146 .cse147 (store (select .cse146 .cse147) .cse148 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse142 (select (select .cse145 .cse141) (+ .cse144 4)))) (or (forall ((v_ArrVal_2893 (Array Int Int))) (let ((.cse140 (select (select (store .cse143 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse140 .cse141) (= .cse142 .cse140)))) (= .cse142 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (= .cse142 .cse141) (= .cse141 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (not (<= 0 .cse144)))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse156 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse153 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse154 (select (select .cse153 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse155 (+ (select (select .cse156 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse152 (store (store .cse156 .cse154 (store (select .cse156 .cse154) .cse155 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894))) (let ((.cse151 (select (select (store (store .cse153 .cse154 (store (select .cse153 .cse154) .cse155 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse150 (select (select .cse152 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse150)) (= .cse151 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (<= 0 (+ (select (select .cse152 .cse151) (+ .cse150 4)) 4)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse165 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse162 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse163 (select (select .cse162 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse164 (+ (select (select .cse165 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse161 (store (store .cse165 .cse163 (store (select .cse165 .cse163) .cse164 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse157 (select (select .cse161 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= .cse157 0)) (not (<= 0 .cse157)) (forall ((v_prenex_37 (Array Int Int))) (let ((.cse159 (store (store .cse162 .cse163 (store (select .cse162 .cse163) .cse164 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse158 (select (select .cse159 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse160 (+ .cse157 4))) (or (not (= .cse158 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (= (select (select .cse159 .cse158) .cse160) .cse158) (<= (select (select .cse161 .cse158) .cse160) 0))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse176 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse173 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse174 (select (select .cse173 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse175 (+ (select (select .cse176 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse170 (store .cse176 .cse174 (store (select .cse176 .cse174) .cse175 0))) (.cse169 (store .cse173 .cse174 (store (select .cse173 .cse174) .cse175 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (or (forall ((v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int))) (let ((.cse168 (store .cse170 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894))) (let ((.cse167 (select (select (store .cse169 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse166 (select (select .cse168 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse166)) (not (= .cse167 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (<= 0 (+ (select (select .cse168 .cse167) (+ .cse166 4)) 4)) (not (<= .cse166 0)))))) (let ((.cse171 (store .cse169 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse172 (select (select .cse171 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse171 .cse172) (+ (select (select (store .cse170 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse172)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse184 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse181 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse182 (select (select .cse181 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse183 (+ (select (select .cse184 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse180 (store (store .cse184 .cse182 (store (select .cse184 .cse182) .cse183 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894)) (.cse179 (store .cse181 .cse182 (store (select .cse181 .cse182) .cse183 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse178 (select (select (store .cse179 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse177 (select (select .cse180 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse177)) (= .cse178 (select (select (store .cse179 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse178 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (<= 0 (+ (select (select .cse180 .cse178) (+ .cse177 4)) 4)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse193 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse196 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse194 (select (select .cse196 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse195 (+ (select (select .cse193 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse191 (store .cse196 .cse194 (store (select .cse196 .cse194) .cse195 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse192 (store .cse191 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse186 (select (select .cse192 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse190 (store .cse193 .cse194 (store (select .cse193 .cse194) .cse195 0)))) (let ((.cse185 (select (select .cse192 .cse186) (+ (select (select (store .cse190 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse185 .cse186) (forall ((v_ArrVal_2893 (Array Int Int))) (let ((.cse187 (select (select (store .cse191 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse187 .cse186) (= .cse185 .cse187) (not (= .cse187 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (forall ((v_ArrVal_2894 (Array Int Int))) (let ((.cse189 (store .cse190 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894))) (let ((.cse188 (select (select .cse189 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse188)) (<= 0 (+ (select (select .cse189 .cse187) (+ .cse188 4)) 4)) (not (<= .cse188 0))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse202 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse205 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse203 (select (select .cse205 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse204 (+ (select (select .cse202 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse198 (store .cse205 .cse203 (store (select .cse205 .cse203) .cse204 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse201 (store .cse198 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse199 (select (select .cse201 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse200 (select (select (store (store .cse202 .cse203 (store (select .cse202 .cse203) .cse204 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse197 (select (select .cse201 .cse199) (+ .cse200 4)))) (or (forall ((v_ArrVal_2893 (Array Int Int))) (= .cse197 (select (select (store .cse198 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse197 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (= .cse197 .cse199) (= .cse199 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (not (<= 0 .cse200)))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse212 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse216 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse213 (select (select .cse216 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse214 (+ (select (select .cse212 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse215 (store .cse216 .cse213 (store (select .cse216 .cse213) .cse214 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse208 (store .cse215 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse207 (select (select .cse208 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse206 (select (select (store .cse215 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse209 (store .cse212 .cse213 (store (select .cse212 .cse213) .cse214 0)))) (or (= .cse206 .cse207) (= (select (select .cse208 .cse207) (+ (select (select (store .cse209 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse206) (not (= .cse206 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (forall ((v_ArrVal_2894 (Array Int Int))) (let ((.cse211 (store .cse209 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894))) (let ((.cse210 (select (select .cse211 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse210)) (<= 0 (+ (select (select .cse211 .cse206) (+ .cse210 4)) 4)) (not (<= .cse210 0))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse226 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse223 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse224 (select (select .cse223 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse225 (+ (select (select .cse226 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse221 (store .cse226 .cse224 (store (select .cse226 .cse224) .cse225 0)))) (let ((.cse222 (store .cse221 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894)) (.cse220 (store .cse223 .cse224 (store (select .cse223 .cse224) .cse225 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse218 (select (select (store .cse220 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse217 (select (select .cse222 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse217)) (= .cse218 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (= (select (let ((.cse219 (store .cse220 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (select .cse219 (select (select .cse219 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse221 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse218) (<= 0 (+ (select (select .cse222 .cse218) (+ .cse217 4)) 4))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse237 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse234 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse235 (select (select .cse234 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse236 (+ (select (select .cse237 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse231 (store .cse237 .cse235 (store (select .cse237 .cse235) .cse236 0))) (.cse230 (store .cse234 .cse235 (store (select .cse234 .cse235) .cse236 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (or (forall ((v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int))) (let ((.cse229 (store .cse231 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894))) (let ((.cse228 (select (select (store .cse230 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse227 (select (select .cse229 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse227)) (= .cse228 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (<= 0 (+ (select (select .cse229 .cse228) (+ .cse227 4)) 4)))))) (let ((.cse232 (store .cse230 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse233 (select (select .cse232 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse232 .cse233) (+ (select (select (store .cse231 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse233)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse245 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse249 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse246 (select (select .cse249 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse247 (+ (select (select .cse245 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse248 (store .cse249 .cse246 (store (select .cse249 .cse246) .cse247 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse244 (store .cse248 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse239 (select (select .cse244 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2893 (Array Int Int))) (let ((.cse238 (select (select (store .cse248 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse238 .cse239) (forall ((v_prenex_36 (Array Int Int))) (let ((.cse241 (store (store .cse245 .cse246 (store (select .cse245 .cse246) .cse247 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse243 (select (select .cse241 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse242 (+ .cse243 4))) (let ((.cse240 (select (select .cse244 .cse239) .cse242))) (or (= .cse240 .cse238) (<= (select (select .cse241 .cse239) .cse242) 0) (not (= .cse240 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (not (<= 0 .cse243))))))))))) (= .cse239 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse257 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse260 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse258 (select (select .cse260 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse259 (+ (select (select .cse257 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse256 (store .cse260 .cse258 (store (select .cse260 .cse258) .cse259 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse250 (store .cse256 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse251 (select (select .cse250 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse252 (store .cse257 .cse258 (store (select .cse257 .cse258) .cse259 0)))) (or (= (select (select .cse250 .cse251) (+ (select (select (store .cse252 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse251) (forall ((v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int))) (let ((.cse255 (store .cse252 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894))) (let ((.cse254 (select (select (store .cse256 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse253 (select (select .cse255 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse253)) (= .cse254 .cse251) (= .cse254 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (<= 0 (+ (select (select .cse255 .cse254) (+ .cse253 4)) 4))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse267 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse264 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse265 (select (select .cse264 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse266 (+ (select (select .cse267 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse261 (store (store .cse267 .cse265 (store (select .cse267 .cse265) .cse266 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse263 (select (select .cse261 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_37 (Array Int Int))) (let ((.cse262 (select (select (store (store .cse264 .cse265 (store (select .cse264 .cse265) .cse266 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse261 .cse262) (+ .cse263 4)) (+ .cse263 1)) (= .cse262 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (not (<= 0 .cse263)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse277 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse274 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse275 (select (select .cse274 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse276 (+ (select (select .cse277 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse271 (store (store .cse277 .cse275 (store (select .cse277 .cse275) .cse276 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse273 (select (select .cse271 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_37 (Array Int Int))) (let ((.cse272 (store .cse274 .cse275 (store (select .cse274 .cse275) .cse276 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse268 (store .cse272 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse270 (+ .cse273 4)) (.cse269 (select (select .cse268 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse268 .cse269) .cse270) .cse269) (<= (select (select .cse271 .cse269) .cse270) 0) (forall ((v_ArrVal_2893 (Array Int Int))) (= (select (select (store .cse272 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse269)) (= .cse269 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))))) (not (<= 0 .cse273)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse285 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse282 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse283 (select (select .cse282 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse284 (+ (select (select .cse285 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse281 (store (store .cse285 .cse283 (store (select .cse285 .cse283) .cse284 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894))) (let ((.cse278 (select (select .cse281 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse278)) (forall ((v_ArrVal_2893 (Array Int Int))) (let ((.cse280 (store .cse282 .cse283 (store (select .cse282 .cse283) .cse284 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse279 (select (select (store .cse280 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse279 (select (select (store .cse280 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse279 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (<= 0 (+ (select (select .cse281 .cse279) (+ .cse278 4)) 4)))))) (not (<= .cse278 0)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse295 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse292 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse293 (select (select .cse292 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse294 (+ (select (select .cse295 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse286 (store (store .cse295 .cse293 (store (select .cse295 .cse293) .cse294 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse289 (select (select .cse286 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_37 (Array Int Int))) (let ((.cse291 (store (store .cse292 .cse293 (store (select .cse292 .cse293) .cse294 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse287 (select (select .cse291 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse288 (+ .cse289 4))) (let ((.cse290 (select (select .cse291 .cse287) .cse288))) (or (< (select (select .cse286 .cse287) .cse288) (+ .cse289 1)) (= .cse290 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (= .cse290 .cse287) (= .cse287 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))))) (not (<= 0 .cse289)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse302 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse299 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse300 (select (select .cse299 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse301 (+ (select (select .cse302 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse298 (select (select (store (store .cse302 .cse300 (store (select .cse302 .cse300) .cse301 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_37 (Array Int Int))) (let ((.cse296 (store (store .cse299 .cse300 (store (select .cse299 .cse300) .cse301 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse297 (select (select .cse296 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse296 .cse297) (+ .cse298 4)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (not (= .cse297 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))))) (not (<= .cse298 0)) (not (<= 0 .cse298))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse311 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse308 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse309 (select (select .cse308 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse310 (+ (select (select .cse311 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse307 (select (select (store (store .cse311 .cse309 (store (select .cse311 .cse309) .cse310 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_37 (Array Int Int))) (let ((.cse305 (store .cse308 .cse309 (store (select .cse308 .cse309) .cse310 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse306 (store .cse305 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse304 (select (select .cse306 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse303 (select (select .cse306 .cse304) (+ .cse307 4)))) (or (= .cse303 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (= .cse303 .cse304) (forall ((v_ArrVal_2893 (Array Int Int))) (= (select (select (store .cse305 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse304)) (= .cse304 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))))))) (not (<= 0 .cse307))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse318 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse322 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse319 (select (select .cse322 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse320 (+ (select (select .cse318 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse321 (store .cse322 .cse319 (store (select .cse322 .cse319) .cse320 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse314 (store .cse321 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse313 (select (select .cse314 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse312 (select (select (store .cse321 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse315 (store .cse318 .cse319 (store (select .cse318 .cse319) .cse320 0)))) (or (= .cse312 .cse313) (= .cse312 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (= (select (select .cse314 .cse313) (+ (select (select (store .cse315 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse312) (forall ((v_ArrVal_2894 (Array Int Int))) (let ((.cse317 (store .cse315 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894))) (let ((.cse316 (select (select .cse317 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse316)) (<= 0 (+ (select (select .cse317 .cse312) (+ .cse316 4)) 4))))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse331 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse328 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse329 (select (select .cse328 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse330 (+ (select (select .cse331 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse323 (store (store .cse331 .cse329 (store (select .cse331 .cse329) .cse330 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse327 (select (select .cse323 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_37 (Array Int Int))) (let ((.cse326 (store (store .cse328 .cse329 (store (select .cse328 .cse329) .cse330 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse325 (+ .cse327 4)) (.cse324 (select (select .cse326 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= (select (select .cse323 .cse324) .cse325) 0) (not (= (select (select .cse326 .cse324) .cse325) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)) (= .cse324 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))))) (not (<= 0 .cse327)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse339 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse343 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse340 (select (select .cse343 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse341 (+ (select (select .cse339 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse342 (store .cse343 .cse340 (store (select .cse343 .cse340) .cse341 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse338 (store .cse342 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse332 (select (select (store .cse342 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse333 (select (select .cse338 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse332 .cse333) (forall ((v_prenex_36 (Array Int Int))) (let ((.cse334 (store (store .cse339 .cse340 (store (select .cse339 .cse340) .cse341 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse336 (select (select .cse334 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse335 (+ .cse336 4))) (let ((.cse337 (select (select .cse338 .cse333) .cse335))) (or (< (select (select .cse334 .cse333) .cse335) (+ .cse336 1)) (= .cse337 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (= .cse337 .cse332) (not (<= 0 .cse336)))))))) (= .cse333 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse354 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse351 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse352 (select (select .cse351 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse353 (+ (select (select .cse354 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse344 (store (store .cse354 .cse352 (store (select .cse354 .cse352) .cse353 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36))) (let ((.cse347 (select (select .cse344 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2893 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse349 (store .cse351 .cse352 (store (select .cse351 .cse352) .cse353 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse350 (store .cse349 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse345 (select (select .cse350 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse346 (+ .cse347 4))) (let ((.cse348 (select (select .cse350 .cse345) .cse346))) (or (< (select (select .cse344 .cse345) .cse346) (+ .cse347 1)) (= .cse348 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (= .cse348 (select (select (store .cse349 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse345 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))))))) (not (<= 0 .cse347)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse363 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse360 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse361 (select (select .cse360 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse362 (+ (select (select .cse363 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse359 (select (select (store (store .cse363 .cse361 (store (select .cse363 .cse361) .cse362 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2893 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse356 (store .cse360 .cse361 (store (select .cse360 .cse361) .cse362 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse358 (store .cse356 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse357 (select (select .cse358 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse355 (select (select .cse358 .cse357) (+ .cse359 4)))) (or (= .cse355 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (= .cse355 (select (select (store .cse356 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse357 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))))))) (not (<= .cse359 0)) (not (<= 0 .cse359))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_2903 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse372 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2902)) (.cse375 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2903))) (let ((.cse373 (select (select .cse375 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse374 (+ (select (select .cse372 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse370 (store .cse375 .cse373 (store (select .cse375 .cse373) .cse374 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|)))) (let ((.cse371 (store .cse370 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_37))) (let ((.cse365 (select (select .cse371 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse369 (store .cse372 .cse373 (store (select .cse372 .cse373) .cse374 0)))) (let ((.cse364 (select (select .cse371 .cse365) (+ (select (select (store .cse369 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse364 .cse365) (forall ((v_ArrVal_2893 (Array Int Int))) (let ((.cse366 (select (select (store .cse370 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse366 .cse365) (= .cse366 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29|) (= .cse364 .cse366) (forall ((v_ArrVal_2894 (Array Int Int))) (let ((.cse368 (store .cse369 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| v_ArrVal_2894))) (let ((.cse367 (select (select .cse368 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse367)) (<= 0 (+ (select (select .cse368 .cse366) (+ .cse367 4)) 4))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_29| |c_#StackHeapBarrier|))))) is different from true [2023-02-15 22:30:44,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804859574] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:44,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:30:44,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27] total 56 [2023-02-15 22:30:44,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563945218] [2023-02-15 22:30:44,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:44,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-02-15 22:30:44,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:44,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-02-15 22:30:44,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=4439, Unknown=26, NotChecked=270, Total=4970 [2023-02-15 22:30:44,481 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 57 states, 54 states have (on average 1.8518518518518519) internal successors, (100), 50 states have internal predecessors, (100), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:30:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:52,963 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2023-02-15 22:30:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 22:30:52,964 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 54 states have (on average 1.8518518518518519) internal successors, (100), 50 states have internal predecessors, (100), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 59 [2023-02-15 22:30:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:52,964 INFO L225 Difference]: With dead ends: 120 [2023-02-15 22:30:52,965 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 22:30:52,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=748, Invalid=8546, Unknown=26, NotChecked=382, Total=9702 [2023-02-15 22:30:52,968 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 922 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 1827 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:52,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 817 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1827 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-02-15 22:30:52,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 22:30:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 74. [2023-02-15 22:30:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:30:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-02-15 22:30:52,971 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 59 [2023-02-15 22:30:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:52,971 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-02-15 22:30:52,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 54 states have (on average 1.8518518518518519) internal successors, (100), 50 states have internal predecessors, (100), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:30:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-02-15 22:30:52,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 22:30:52,972 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:52,972 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:30:52,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 22:30:53,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-15 22:30:53,177 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:30:53,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash 827850517, now seen corresponding path program 1 times [2023-02-15 22:30:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:53,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409305385] [2023-02-15 22:30:53,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:54,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:30:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:30:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:55,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:30:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:30:55,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:55,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409305385] [2023-02-15 22:30:55,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409305385] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:55,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152451292] [2023-02-15 22:30:55,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:55,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:55,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:55,912 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:30:55,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 22:30:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:56,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-15 22:30:56,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:57,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:30:57,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:30:58,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:58,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 22:30:58,549 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:30:58,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:30:59,549 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-02-15 22:30:59,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 39 [2023-02-15 22:30:59,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:59,560 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 28 treesize of output 30 [2023-02-15 22:30:59,729 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:30:59,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 92 [2023-02-15 22:30:59,750 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:30:59,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 79 [2023-02-15 22:30:59,912 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 67 treesize of output 51 [2023-02-15 22:31:00,379 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 22:31:00,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 25 [2023-02-15 22:31:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:31:00,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:01,088 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3088 (Array Int Int))) (not (= 0 (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3087))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3088) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-02-15 22:31:01,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:01,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 634 treesize of output 574 [2023-02-15 22:31:01,843 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 562 treesize of output 558 [2023-02-15 22:31:01,850 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 558 treesize of output 550 [2023-02-15 22:31:02,070 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse8 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse5))) (let ((.cse2 (not .cse3)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5)) (.cse7 (not .cse8))) (let ((.cse0 (and (or .cse8 (and (or .cse3 (forall ((v_ArrVal_3087 (Array Int Int)) (v_arrayElimCell_131 Int) (v_arrayElimCell_130 Int)) (not (= 0 (select (let ((.cse12 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 (+ v_arrayElimCell_130 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3087))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_131 4)))))) (or .cse2 (forall ((v_ArrVal_3087 (Array Int Int)) (v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (not (= 0 (select (let ((.cse13 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 (+ v_arrayElimCell_130 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3087))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_132 4)))))))) (or (let ((.cse14 (forall ((v_ArrVal_3087 (Array Int Int)) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (not (= 0 (select (let ((.cse15 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 (+ v_arrayElimCell_130 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3087))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_133 4))))))) (and (or .cse14 .cse2) (or .cse14 .cse3))) .cse7)))) (and (or .cse0 (= |c_ULTIMATE.start_sll_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or .cse0 (= |c_ULTIMATE.start_sll_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (let ((.cse1 (forall ((v_ArrVal_3087 (Array Int Int)) (v_arrayElimCell_131 Int) (v_arrayElimCell_133 Int)) (not (= 0 (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 (+ v_arrayElimCell_131 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3087))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_133 4))))))) (and (or .cse1 .cse2) (or .cse3 .cse1))) .cse7) (or .cse8 (and (or .cse3 (forall ((v_ArrVal_3087 (Array Int Int)) (v_arrayElimCell_131 Int)) (not (= 0 (let ((.cse10 (+ v_arrayElimCell_131 4))) (select (let ((.cse9 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3087))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse10)))))) (or .cse2 (forall ((v_ArrVal_3087 (Array Int Int)) (v_arrayElimCell_131 Int) (v_arrayElimCell_132 Int)) (not (= 0 (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 (+ v_arrayElimCell_131 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3087))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_132 4))))))))))))) is different from false [2023-02-15 22:31:44,465 WARN L233 SmtUtils]: Spent 41.25s on a formula simplification. DAG size of input: 82 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:31:45,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152451292] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:45,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:31:45,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 51 [2023-02-15 22:31:45,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825396328] [2023-02-15 22:31:45,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:45,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 22:31:45,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:45,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 22:31:45,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3195, Unknown=60, NotChecked=230, Total=3660 [2023-02-15 22:31:45,404 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 45 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:31:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:56,442 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2023-02-15 22:31:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 22:31:56,443 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 45 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 60 [2023-02-15 22:31:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:56,443 INFO L225 Difference]: With dead ends: 89 [2023-02-15 22:31:56,443 INFO L226 Difference]: Without dead ends: 89 [2023-02-15 22:31:56,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 56.6s TimeCoverageRelationStatistics Valid=567, Invalid=6352, Unknown=61, NotChecked=330, Total=7310 [2023-02-15 22:31:56,445 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 551 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:56,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 766 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-02-15 22:31:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-15 22:31:56,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 74. [2023-02-15 22:31:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 69 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:31:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2023-02-15 22:31:56,448 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 60 [2023-02-15 22:31:56,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:56,448 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2023-02-15 22:31:56,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 45 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:31:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2023-02-15 22:31:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 22:31:56,449 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:56,449 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:56,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 22:31:56,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 22:31:56,657 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:31:56,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:56,657 INFO L85 PathProgramCache]: Analyzing trace with hash 832836797, now seen corresponding path program 1 times [2023-02-15 22:31:56,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:56,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384340456] [2023-02-15 22:31:56,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:56,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:32:00,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:32:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:32:00,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:32:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:32:00,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:32:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:32:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:32:01,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:32:01,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384340456] [2023-02-15 22:32:01,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384340456] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:32:01,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998927870] [2023-02-15 22:32:01,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:32:01,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:32:01,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:32:01,775 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:32:01,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 22:32:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:32:02,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 133 conjunts are in the unsatisfiable core [2023-02-15 22:32:02,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:32:02,295 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 22:32:03,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:32:03,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:32:03,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:32:04,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 22:32:04,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:04,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:32:04,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:04,840 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 25 treesize of output 25 [2023-02-15 22:32:04,866 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:32:04,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:32:06,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:06,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 56 [2023-02-15 22:32:06,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 22:32:06,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:06,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2023-02-15 22:32:06,787 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:32:06,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 89 [2023-02-15 22:32:06,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:06,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:06,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-02-15 22:32:06,820 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 43 treesize of output 34 [2023-02-15 22:32:07,737 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:32:07,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:07,746 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:32:07,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 47 [2023-02-15 22:32:07,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:07,773 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:32:07,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2023-02-15 22:32:08,617 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 22:32:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:32:08,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:32:10,704 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3283 (Array Int Int)) (v_ArrVal_3285 (Array Int Int)) (v_ArrVal_3284 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3285))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (= (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3283))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse0 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_3284)) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2023-02-15 22:32:14,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:32:14,874 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 319 treesize of output 312 [2023-02-15 22:32:14,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:32:14,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4980 treesize of output 4708 [2023-02-15 22:32:14,950 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 5672 treesize of output 4720 [2023-02-15 22:32:15,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:32:15,026 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 1849 treesize of output 1717 [2023-02-15 22:32:15,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:32:15,314 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 4583 treesize of output 4179 [2023-02-15 22:32:36,164 WARN L233 SmtUtils]: Spent 16.35s on a formula simplification. DAG size of input: 87 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:32:36,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998927870] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:32:36,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:32:36,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 58 [2023-02-15 22:32:36,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413090739] [2023-02-15 22:32:36,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:32:36,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-02-15 22:32:36,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:32:36,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-02-15 22:32:36,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=4764, Unknown=16, NotChecked=138, Total=5112 [2023-02-15 22:32:36,168 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 58 states, 56 states have (on average 1.875) internal successors, (105), 52 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:32:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:32:49,051 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2023-02-15 22:32:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 22:32:49,051 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.875) internal successors, (105), 52 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2023-02-15 22:32:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:32:49,052 INFO L225 Difference]: With dead ends: 75 [2023-02-15 22:32:49,052 INFO L226 Difference]: Without dead ends: 75 [2023-02-15 22:32:49,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1550 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=536, Invalid=8194, Unknown=16, NotChecked=184, Total=8930 [2023-02-15 22:32:49,053 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 443 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 1991 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:32:49,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 999 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1991 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-02-15 22:32:49,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-15 22:32:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-02-15 22:32:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:32:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2023-02-15 22:32:49,056 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 63 [2023-02-15 22:32:49,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:32:49,057 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2023-02-15 22:32:49,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.875) internal successors, (105), 52 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:32:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2023-02-15 22:32:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 22:32:49,059 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:32:49,059 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:32:49,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-02-15 22:32:49,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:32:49,265 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:32:49,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:32:49,265 INFO L85 PathProgramCache]: Analyzing trace with hash 48137412, now seen corresponding path program 2 times [2023-02-15 22:32:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:32:49,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061298464] [2023-02-15 22:32:49,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:32:49,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:32:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:32:52,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:32:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:32:53,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:32:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:32:53,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:32:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:32:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:32:54,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:32:54,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061298464] [2023-02-15 22:32:54,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061298464] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:32:54,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445056241] [2023-02-15 22:32:54,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:32:54,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:32:54,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:32:54,813 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:32:54,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 22:32:55,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:32:55,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:32:55,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 147 conjunts are in the unsatisfiable core [2023-02-15 22:32:55,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:32:56,279 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-15 22:32:56,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-02-15 22:32:56,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:32:57,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:57,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:32:57,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 23 [2023-02-15 22:32:57,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:32:57,991 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 22:32:59,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:59,160 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 22:32:59,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 57 [2023-02-15 22:32:59,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:59,172 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 64 treesize of output 53 [2023-02-15 22:32:59,266 INFO L321 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2023-02-15 22:32:59,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 64 [2023-02-15 22:33:01,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:01,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:33:01,673 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 153 treesize of output 71 [2023-02-15 22:33:01,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:01,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2023-02-15 22:33:02,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:33:02,056 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2023-02-15 22:33:02,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 181 treesize of output 85 [2023-02-15 22:33:02,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:02,112 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 22:33:02,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 185 [2023-02-15 22:33:03,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:03,381 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 22:33:03,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 123 [2023-02-15 22:33:04,852 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:33:04,852 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:33:04,886 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-15 22:33:04,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 137 treesize of output 50 [2023-02-15 22:33:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 23 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:33:05,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:33:11,693 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3488 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_38| Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_38| v_ArrVal_3499)) (.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_38| v_ArrVal_3500))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse8 (+ (select (select .cse11 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse5 (store (store .cse11 .cse10 (store (select .cse11 .cse10) .cse8 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_38| v_ArrVal_3488))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (let ((.cse7 (select .cse9 .cse10))) (let ((.cse6 (store .cse9 .cse10 (store .cse7 .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_38|)))) (store .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_38| (store (select .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_38|) 4 (select .cse7 .cse8))))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (let ((.cse3 (select (select .cse5 .cse1) .cse2))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_38| 1) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ .cse3 4))) 1) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_38| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_38|))) (not (<= 0 .cse4)) (not (<= 0 .cse3)))))))))) is different from false [2023-02-15 22:33:11,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445056241] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:33:11,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:33:11,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36] total 72 [2023-02-15 22:33:11,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425935413] [2023-02-15 22:33:11,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:33:11,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-02-15 22:33:11,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:33:11,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-02-15 22:33:11,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=7672, Unknown=22, NotChecked=176, Total=8190 [2023-02-15 22:33:11,704 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 73 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 65 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:33:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:33:34,223 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2023-02-15 22:33:34,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 22:33:34,224 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 65 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2023-02-15 22:33:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:33:34,225 INFO L225 Difference]: With dead ends: 114 [2023-02-15 22:33:34,225 INFO L226 Difference]: Without dead ends: 114 [2023-02-15 22:33:34,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 123 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3723 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=1102, Invalid=14132, Unknown=22, NotChecked=244, Total=15500 [2023-02-15 22:33:34,227 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 808 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 2643 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:33:34,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1025 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2643 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2023-02-15 22:33:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-15 22:33:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 77. [2023-02-15 22:33:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 72 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:33:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2023-02-15 22:33:34,230 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 64 [2023-02-15 22:33:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:33:34,230 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2023-02-15 22:33:34,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 65 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:33:34,231 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2023-02-15 22:33:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 22:33:34,231 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:33:34,231 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:33:34,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 22:33:34,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 22:33:34,439 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 22:33:34,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:33:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash 48137413, now seen corresponding path program 2 times [2023-02-15 22:33:34,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:33:34,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666039686] [2023-02-15 22:33:34,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:33:34,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:33:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:33:39,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:33:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:33:39,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:33:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:33:40,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:33:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:33:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:33:41,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:33:41,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666039686] [2023-02-15 22:33:41,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666039686] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:33:41,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444767028] [2023-02-15 22:33:41,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:33:41,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:33:41,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:33:41,557 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:33:41,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 22:33:41,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:33:41,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:33:41,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 173 conjunts are in the unsatisfiable core [2023-02-15 22:33:41,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:33:43,292 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:33:43,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:33:43,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:33:43,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:33:43,964 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