./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 3dbbec33 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-?-3dbbec3 [2023-02-14 13:57:05,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 13:57:05,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 13:57:05,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 13:57:05,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 13:57:05,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 13:57:05,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 13:57:05,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 13:57:05,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 13:57:05,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 13:57:05,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 13:57:05,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 13:57:05,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 13:57:05,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 13:57:05,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 13:57:05,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 13:57:05,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 13:57:05,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 13:57:05,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 13:57:05,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 13:57:05,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 13:57:05,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 13:57:05,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 13:57:05,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 13:57:05,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 13:57:05,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 13:57:05,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 13:57:05,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 13:57:05,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 13:57:05,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 13:57:05,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 13:57:05,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 13:57:05,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 13:57:05,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 13:57:05,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 13:57:05,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 13:57:05,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 13:57:05,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 13:57:05,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 13:57:05,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 13:57:05,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 13:57:05,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 13:57:05,579 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 13:57:05,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 13:57:05,580 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 13:57:05,580 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 13:57:05,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 13:57:05,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 13:57:05,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 13:57:05,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 13:57:05,589 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 13:57:05,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 13:57:05,590 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 13:57:05,590 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 13:57:05,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 13:57:05,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 13:57:05,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 13:57:05,591 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 13:57:05,591 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 13:57:05,591 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 13:57:05,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 13:57:05,592 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 13:57:05,592 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 13:57:05,592 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 13:57:05,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 13:57:05,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 13:57:05,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 13:57:05,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:57:05,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 13:57:05,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 13:57:05,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 13:57:05,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 13:57:05,594 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 13:57:05,594 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 13:57:05,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 13:57:05,595 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 13:57:05,595 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-14 13:57:05,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 13:57:05,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 13:57:05,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 13:57:05,854 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 13:57:05,855 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 13:57:05,856 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-14 13:57:07,002 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 13:57:07,200 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 13:57:07,200 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-02-14 13:57:07,214 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4959fd9/1a8bb0062ad5479eb9b8b7ff19d47211/FLAGad6fe054d [2023-02-14 13:57:07,225 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4959fd9/1a8bb0062ad5479eb9b8b7ff19d47211 [2023-02-14 13:57:07,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 13:57:07,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 13:57:07,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 13:57:07,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 13:57:07,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 13:57:07,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:57:07" (1/1) ... [2023-02-14 13:57:07,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d31cdd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:07, skipping insertion in model container [2023-02-14 13:57:07,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:57:07" (1/1) ... [2023-02-14 13:57:07,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 13:57:07,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 13:57:07,559 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-14 13:57:07,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:57:07,579 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 13:57:07,659 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-14 13:57:07,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:57:07,724 INFO L208 MainTranslator]: Completed translation [2023-02-14 13:57:07,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:07 WrapperNode [2023-02-14 13:57:07,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 13:57:07,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 13:57:07,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 13:57:07,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 13:57:07,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:07" (1/1) ... [2023-02-14 13:57:07,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:07" (1/1) ... [2023-02-14 13:57:07,776 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2023-02-14 13:57:07,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 13:57:07,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 13:57:07,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 13:57:07,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 13:57:07,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:07" (1/1) ... [2023-02-14 13:57:07,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:07" (1/1) ... [2023-02-14 13:57:07,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:07" (1/1) ... [2023-02-14 13:57:07,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:07" (1/1) ... [2023-02-14 13:57:07,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:07" (1/1) ... [2023-02-14 13:57:07,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:07" (1/1) ... [2023-02-14 13:57:07,804 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:07" (1/1) ... [2023-02-14 13:57:07,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:07" (1/1) ... [2023-02-14 13:57:07,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 13:57:07,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 13:57:07,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 13:57:07,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 13:57:07,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:07" (1/1) ... [2023-02-14 13:57:07,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:57:07,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:07,855 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-14 13:57:07,867 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-14 13:57:07,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 13:57:07,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 13:57:07,899 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-14 13:57:07,899 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-14 13:57:07,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 13:57:07,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 13:57:07,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 13:57:07,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 13:57:07,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 13:57:07,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 13:57:07,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 13:57:07,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 13:57:07,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 13:57:07,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 13:57:08,029 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 13:57:08,031 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 13:57:08,304 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 13:57:08,310 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 13:57:08,310 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-14 13:57:08,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:57:08 BoogieIcfgContainer [2023-02-14 13:57:08,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 13:57:08,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 13:57:08,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 13:57:08,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 13:57:08,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:57:07" (1/3) ... [2023-02-14 13:57:08,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212bd5f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:57:08, skipping insertion in model container [2023-02-14 13:57:08,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:07" (2/3) ... [2023-02-14 13:57:08,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212bd5f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:57:08, skipping insertion in model container [2023-02-14 13:57:08,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:57:08" (3/3) ... [2023-02-14 13:57:08,319 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2023-02-14 13:57:08,334 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 13:57:08,334 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-02-14 13:57:08,378 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 13:57:08,383 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;@7ce35ea, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 13:57:08,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-02-14 13:57:08,387 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-14 13:57:08,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 13:57:08,391 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:08,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:08,392 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-14 13:57:08,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:08,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1813843193, now seen corresponding path program 1 times [2023-02-14 13:57:08,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:08,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353135999] [2023-02-14 13:57:08,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:08,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:08,613 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-14 13:57:08,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:08,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353135999] [2023-02-14 13:57:08,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353135999] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:08,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:57:08,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:57:08,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081177772] [2023-02-14 13:57:08,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:08,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:57:08,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:08,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:57:08,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:57:08,643 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-14 13:57:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:08,733 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2023-02-14 13:57:08,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:57:08,737 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-14 13:57:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:08,743 INFO L225 Difference]: With dead ends: 80 [2023-02-14 13:57:08,744 INFO L226 Difference]: Without dead ends: 77 [2023-02-14 13:57:08,749 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-14 13:57:08,755 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-14 13:57:08,756 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-14 13:57:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-14 13:57:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-14 13:57:08,789 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-14 13:57:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-14 13:57:08,792 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 7 [2023-02-14 13:57:08,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:08,793 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-14 13:57:08,793 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-14 13:57:08,793 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-14 13:57:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 13:57:08,794 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:08,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:08,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 13:57:08,794 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-14 13:57:08,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:08,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1813843194, now seen corresponding path program 1 times [2023-02-14 13:57:08,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:08,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370381036] [2023-02-14 13:57:08,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:08,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:08,902 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-14 13:57:08,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:08,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370381036] [2023-02-14 13:57:08,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370381036] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:08,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:57:08,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:57:08,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081507216] [2023-02-14 13:57:08,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:08,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:57:08,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:08,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:57:08,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:57:08,907 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-14 13:57:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:08,954 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2023-02-14 13:57:08,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:57:08,955 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-14 13:57:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:08,956 INFO L225 Difference]: With dead ends: 75 [2023-02-14 13:57:08,956 INFO L226 Difference]: Without dead ends: 75 [2023-02-14 13:57:08,956 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-14 13:57:08,958 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:08,958 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.0s Time] [2023-02-14 13:57:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-14 13:57:08,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-02-14 13:57:08,964 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-14 13:57:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2023-02-14 13:57:08,965 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 7 [2023-02-14 13:57:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:08,966 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2023-02-14 13:57:08,966 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-14 13:57:08,966 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2023-02-14 13:57:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 13:57:08,967 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:08,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:08,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 13:57:08,968 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-14 13:57:08,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:08,969 INFO L85 PathProgramCache]: Analyzing trace with hash 649951808, now seen corresponding path program 1 times [2023-02-14 13:57:08,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:08,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462210199] [2023-02-14 13:57:08,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:08,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:09,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:09,204 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-14 13:57:09,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:09,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462210199] [2023-02-14 13:57:09,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462210199] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:09,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:57:09,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:57:09,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403738685] [2023-02-14 13:57:09,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:09,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:57:09,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:09,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:57:09,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:57:09,211 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-14 13:57:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:09,397 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2023-02-14 13:57:09,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:57:09,399 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-14 13:57:09,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:09,404 INFO L225 Difference]: With dead ends: 79 [2023-02-14 13:57:09,404 INFO L226 Difference]: Without dead ends: 79 [2023-02-14 13:57:09,407 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-14 13:57:09,409 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.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:09,411 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.1s Time] [2023-02-14 13:57:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-14 13:57:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2023-02-14 13:57:09,422 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-14 13:57:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-02-14 13:57:09,425 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 13 [2023-02-14 13:57:09,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:09,426 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-02-14 13:57:09,427 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-14 13:57:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-02-14 13:57:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 13:57:09,429 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:09,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:09,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 13:57:09,429 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-14 13:57:09,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash 649951809, now seen corresponding path program 1 times [2023-02-14 13:57:09,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:09,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687791306] [2023-02-14 13:57:09,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:09,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:09,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:09,711 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-14 13:57:09,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:09,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687791306] [2023-02-14 13:57:09,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687791306] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:09,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:57:09,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:57:09,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498898168] [2023-02-14 13:57:09,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:09,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:57:09,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:09,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:57:09,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:57:09,715 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-14 13:57:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:09,892 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2023-02-14 13:57:09,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:57:09,893 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-14 13:57:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:09,895 INFO L225 Difference]: With dead ends: 78 [2023-02-14 13:57:09,896 INFO L226 Difference]: Without dead ends: 78 [2023-02-14 13:57:09,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-14 13:57:09,905 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-14 13:57:09,907 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-14 13:57:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-14 13:57:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2023-02-14 13:57:09,917 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-14 13:57:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2023-02-14 13:57:09,920 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 13 [2023-02-14 13:57:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:09,921 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2023-02-14 13:57:09,921 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-14 13:57:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2023-02-14 13:57:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 13:57:09,922 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:09,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:09,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 13:57:09,923 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-14 13:57:09,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash 87749440, now seen corresponding path program 1 times [2023-02-14 13:57:09,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:09,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838894286] [2023-02-14 13:57:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:09,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:09,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 13:57:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:09,997 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-14 13:57:09,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:09,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838894286] [2023-02-14 13:57:09,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838894286] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:09,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:57:09,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:57:09,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295078918] [2023-02-14 13:57:09,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:09,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:57:09,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:09,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:57:10,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:57:10,000 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-14 13:57:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:10,054 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2023-02-14 13:57:10,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:57:10,055 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-14 13:57:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:10,055 INFO L225 Difference]: With dead ends: 79 [2023-02-14 13:57:10,056 INFO L226 Difference]: Without dead ends: 79 [2023-02-14 13:57:10,056 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-14 13:57:10,057 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.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:10,057 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.0s Time] [2023-02-14 13:57:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-14 13:57:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2023-02-14 13:57:10,062 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-14 13:57:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-02-14 13:57:10,062 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 15 [2023-02-14 13:57:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:10,063 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-02-14 13:57:10,063 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-14 13:57:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-02-14 13:57:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-14 13:57:10,064 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:10,064 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-14 13:57:10,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 13:57:10,064 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-14 13:57:10,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:10,065 INFO L85 PathProgramCache]: Analyzing trace with hash -847170750, now seen corresponding path program 1 times [2023-02-14 13:57:10,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:10,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048590323] [2023-02-14 13:57:10,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:10,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:10,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 13:57:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:10,159 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-14 13:57:10,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:10,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048590323] [2023-02-14 13:57:10,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048590323] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:10,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881541503] [2023-02-14 13:57:10,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:10,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:10,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:10,167 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-14 13:57:10,168 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-14 13:57:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:10,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 13:57:10,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:10,355 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-14 13:57:10,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:10,402 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-14 13:57:10,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881541503] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:57:10,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:57:10,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-14 13:57:10,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712106571] [2023-02-14 13:57:10,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:10,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 13:57:10,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:10,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 13:57:10,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:57:10,405 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-14 13:57:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:10,509 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2023-02-14 13:57:10,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:57:10,510 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-14 13:57:10,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:10,511 INFO L225 Difference]: With dead ends: 80 [2023-02-14 13:57:10,511 INFO L226 Difference]: Without dead ends: 80 [2023-02-14 13:57:10,511 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-14 13:57:10,512 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 13:57:10,512 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-14 13:57:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-14 13:57:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-14 13:57:10,516 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-14 13:57:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2023-02-14 13:57:10,516 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 28 [2023-02-14 13:57:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:10,520 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2023-02-14 13:57:10,520 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-14 13:57:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2023-02-14 13:57:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:57:10,521 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:10,521 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-14 13:57:10,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 13:57:10,722 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-14 13:57:10,722 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-14 13:57:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:10,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1562281600, now seen corresponding path program 2 times [2023-02-14 13:57:10,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:10,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345138583] [2023-02-14 13:57:10,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:10,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:11,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:11,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:11,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:11,279 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-14 13:57:11,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:11,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345138583] [2023-02-14 13:57:11,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345138583] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:11,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:57:11,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:57:11,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015492647] [2023-02-14 13:57:11,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:11,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:57:11,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:11,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:57:11,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:57:11,282 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-14 13:57:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:11,409 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2023-02-14 13:57:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 13:57:11,409 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-14 13:57:11,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:11,410 INFO L225 Difference]: With dead ends: 88 [2023-02-14 13:57:11,411 INFO L226 Difference]: Without dead ends: 88 [2023-02-14 13:57:11,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:57:11,412 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-14 13:57:11,412 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-14 13:57:11,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-14 13:57:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2023-02-14 13:57:11,430 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-14 13:57:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2023-02-14 13:57:11,432 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 41 [2023-02-14 13:57:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:11,433 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2023-02-14 13:57:11,435 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-14 13:57:11,436 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2023-02-14 13:57:11,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:57:11,438 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:11,438 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-14 13:57:11,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 13:57:11,438 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-14 13:57:11,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:11,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1562281601, now seen corresponding path program 1 times [2023-02-14 13:57:11,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:11,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608843856] [2023-02-14 13:57:11,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:11,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:11,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:11,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:12,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 13:57:12,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:12,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608843856] [2023-02-14 13:57:12,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608843856] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:12,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597012062] [2023-02-14 13:57:12,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:12,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:12,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:12,126 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-14 13:57:12,128 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-14 13:57:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:12,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 13:57:12,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:12,291 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-14 13:57:12,331 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-14 13:57:12,360 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_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))))) is different from true [2023-02-14 13:57:12,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:12,420 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-14 13:57:12,459 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-14 13:57:12,473 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_453 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453) |c_#length|)))) is different from true [2023-02-14 13:57:12,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:12,519 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-14 13:57:12,606 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-14 13:57:12,616 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)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454) |c_#length|)))) is different from true [2023-02-14 13:57:12,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:12,677 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-14 13:57:12,684 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-14 13:57:12,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:12,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597012062] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:12,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:57:12,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-02-14 13:57:12,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615105670] [2023-02-14 13:57:12,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:12,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 13:57:12,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:12,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 13:57:12,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=225, Unknown=3, NotChecked=96, Total=380 [2023-02-14 13:57:12,788 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:57:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:13,066 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2023-02-14 13:57:13,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:57:13,067 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2023-02-14 13:57:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:13,068 INFO L225 Difference]: With dead ends: 84 [2023-02-14 13:57:13,068 INFO L226 Difference]: Without dead ends: 84 [2023-02-14 13:57:13,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=341, Unknown=3, NotChecked=120, Total=552 [2023-02-14 13:57:13,069 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 245 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:13,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 178 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 220 Invalid, 0 Unknown, 195 Unchecked, 0.2s Time] [2023-02-14 13:57:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-14 13:57:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2023-02-14 13:57:13,072 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-14 13:57:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2023-02-14 13:57:13,072 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 41 [2023-02-14 13:57:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:13,073 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2023-02-14 13:57:13,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:57:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2023-02-14 13:57:13,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 13:57:13,074 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:13,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] [2023-02-14 13:57:13,085 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-14 13:57:13,282 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-14 13:57:13,283 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-14 13:57:13,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:13,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1665526433, now seen corresponding path program 1 times [2023-02-14 13:57:13,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:13,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143510491] [2023-02-14 13:57:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:13,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:13,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:13,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:13,862 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-14 13:57:13,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:13,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143510491] [2023-02-14 13:57:13,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143510491] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:13,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887696003] [2023-02-14 13:57:13,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:13,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:13,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:13,865 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-14 13:57:13,867 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-14 13:57:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:14,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-14 13:57:14,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:14,058 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-14 13:57:14,219 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-14 13:57:14,322 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_615 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_615)))) is different from true [2023-02-14 13:57:14,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:14,358 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-14 13:57:14,381 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-02-14 13:57:14,382 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 23 treesize of output 24 [2023-02-14 13:57:14,413 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-14 13:57:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2023-02-14 13:57:14,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:14,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887696003] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:14,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:57:14,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2023-02-14 13:57:14,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965519180] [2023-02-14 13:57:14,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:14,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 13:57:14,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:14,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 13:57:14,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2023-02-14 13:57:14,502 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 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-14 13:57:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:15,090 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2023-02-14 13:57:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 13:57:15,090 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 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 44 [2023-02-14 13:57:15,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:15,091 INFO L225 Difference]: With dead ends: 124 [2023-02-14 13:57:15,091 INFO L226 Difference]: Without dead ends: 124 [2023-02-14 13:57:15,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1064, Unknown=1, NotChecked=68, Total=1332 [2023-02-14 13:57:15,092 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 594 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:15,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 374 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 534 Invalid, 0 Unknown, 73 Unchecked, 0.4s Time] [2023-02-14 13:57:15,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-14 13:57:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2023-02-14 13:57:15,095 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-14 13:57:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2023-02-14 13:57:15,095 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 44 [2023-02-14 13:57:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:15,096 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-02-14 13:57:15,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 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-14 13:57:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2023-02-14 13:57:15,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 13:57:15,097 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:15,097 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-14 13:57:15,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 13:57:15,297 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-14 13:57:15,297 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-14 13:57:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1665526434, now seen corresponding path program 1 times [2023-02-14 13:57:15,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:15,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699325488] [2023-02-14 13:57:15,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:15,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:15,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:15,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:16,285 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-14 13:57:16,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:16,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699325488] [2023-02-14 13:57:16,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699325488] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:16,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191643961] [2023-02-14 13:57:16,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:16,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:16,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:16,289 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-14 13:57:16,310 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-14 13:57:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:16,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-14 13:57:16,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:16,481 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-14 13:57:16,485 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-14 13:57:16,863 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-14 13:57:16,867 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-14 13:57:16,985 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_782) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_783) |c_#memory_$Pointer$.base|))) is different from true [2023-02-14 13:57:17,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:17,024 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 23 [2023-02-14 13:57:17,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:17,029 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-14 13:57:17,044 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:57:17,044 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-14 13:57:17,048 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-14 13:57:17,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-14 13:57:17,099 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-14 13:57:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2023-02-14 13:57:17,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:18,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191643961] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:18,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:57:18,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2023-02-14 13:57:18,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905781666] [2023-02-14 13:57:18,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:18,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-14 13:57:18,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:18,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-14 13:57:18,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1085, Unknown=1, NotChecked=66, Total=1260 [2023-02-14 13:57:18,055 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 32 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 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-14 13:57:19,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:19,109 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2023-02-14 13:57:19,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 13:57:19,109 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 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 44 [2023-02-14 13:57:19,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:19,128 INFO L225 Difference]: With dead ends: 114 [2023-02-14 13:57:19,128 INFO L226 Difference]: Without dead ends: 114 [2023-02-14 13:57:19,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=228, Invalid=1937, Unknown=1, NotChecked=90, Total=2256 [2023-02-14 13:57:19,129 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 297 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:19,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 623 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 866 Invalid, 0 Unknown, 116 Unchecked, 0.5s Time] [2023-02-14 13:57:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-14 13:57:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 74. [2023-02-14 13:57:19,132 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-14 13:57:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2023-02-14 13:57:19,133 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 44 [2023-02-14 13:57:19,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:19,133 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2023-02-14 13:57:19,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 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-14 13:57:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2023-02-14 13:57:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 13:57:19,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:19,134 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-14 13:57:19,147 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-14 13:57:19,341 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-14 13:57:19,341 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-14 13:57:19,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:19,342 INFO L85 PathProgramCache]: Analyzing trace with hash 91710248, now seen corresponding path program 1 times [2023-02-14 13:57:19,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:19,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908701528] [2023-02-14 13:57:19,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:19,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:19,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:19,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:19,414 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-14 13:57:19,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:19,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908701528] [2023-02-14 13:57:19,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908701528] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:19,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:57:19,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:57:19,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191913042] [2023-02-14 13:57:19,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:19,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:57:19,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:19,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:57:19,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:57:19,417 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-14 13:57:19,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:19,461 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2023-02-14 13:57:19,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:57:19,462 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-14 13:57:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:19,463 INFO L225 Difference]: With dead ends: 109 [2023-02-14 13:57:19,463 INFO L226 Difference]: Without dead ends: 109 [2023-02-14 13:57:19,463 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-14 13:57:19,464 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-14 13:57:19,464 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-14 13:57:19,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-14 13:57:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2023-02-14 13:57:19,466 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-14 13:57:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2023-02-14 13:57:19,467 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 45 [2023-02-14 13:57:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:19,467 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2023-02-14 13:57:19,467 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-14 13:57:19,467 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2023-02-14 13:57:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 13:57:19,468 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:19,468 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-14 13:57:19,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 13:57:19,468 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-14 13:57:19,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1451944619, now seen corresponding path program 1 times [2023-02-14 13:57:19,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:19,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742151747] [2023-02-14 13:57:19,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:19,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:19,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:19,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:19,577 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-14 13:57:19,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:19,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742151747] [2023-02-14 13:57:19,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742151747] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:19,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:57:19,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:57:19,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952983379] [2023-02-14 13:57:19,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:19,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:57:19,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:19,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:57:19,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:57:19,583 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-14 13:57:19,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:19,687 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2023-02-14 13:57:19,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:57:19,687 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-14 13:57:19,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:19,688 INFO L225 Difference]: With dead ends: 86 [2023-02-14 13:57:19,688 INFO L226 Difference]: Without dead ends: 86 [2023-02-14 13:57:19,689 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-14 13:57:19,689 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-14 13:57:19,690 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-14 13:57:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-14 13:57:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2023-02-14 13:57:19,692 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-14 13:57:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2023-02-14 13:57:19,693 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 46 [2023-02-14 13:57:19,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:19,694 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2023-02-14 13:57:19,694 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-14 13:57:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2023-02-14 13:57:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 13:57:19,695 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:19,696 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-14 13:57:19,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-14 13:57:19,696 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-14 13:57:19,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:19,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1451944618, now seen corresponding path program 1 times [2023-02-14 13:57:19,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:19,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825223245] [2023-02-14 13:57:19,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:19,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:19,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:19,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:19,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 13:57:19,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:19,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825223245] [2023-02-14 13:57:19,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825223245] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:19,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145504983] [2023-02-14 13:57:19,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:19,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:19,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:19,873 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-14 13:57:19,896 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-14 13:57:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:20,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 13:57:20,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:20,086 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-14 13:57:20,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:57:20,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145504983] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:20,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:57:20,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-14 13:57:20,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909458257] [2023-02-14 13:57:20,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:20,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:57:20,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:20,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:57:20,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:57:20,089 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.75) 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-14 13:57:20,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:20,105 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2023-02-14 13:57:20,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:57:20,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) 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-14 13:57:20,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:20,106 INFO L225 Difference]: With dead ends: 73 [2023-02-14 13:57:20,106 INFO L226 Difference]: Without dead ends: 73 [2023-02-14 13:57:20,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:57:20,107 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:20,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 131 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:57:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-14 13:57:20,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-14 13:57:20,110 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-14 13:57:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2023-02-14 13:57:20,110 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 46 [2023-02-14 13:57:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:20,111 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2023-02-14 13:57:20,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) 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-14 13:57:20,111 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2023-02-14 13:57:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-14 13:57:20,112 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:20,112 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-14 13:57:20,121 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-14 13:57:20,319 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,SelfDestructingSolverStorable12 [2023-02-14 13:57:20,319 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-14 13:57:20,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:20,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2059192403, now seen corresponding path program 1 times [2023-02-14 13:57:20,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:20,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448237900] [2023-02-14 13:57:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:20,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:20,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:20,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:20,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 13:57:20,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:20,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448237900] [2023-02-14 13:57:20,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448237900] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:20,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187787170] [2023-02-14 13:57:20,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:20,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:20,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:20,529 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-14 13:57:20,551 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-14 13:57:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:20,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 13:57:20,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:20,754 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-14 13:57:20,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:57:20,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187787170] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:20,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:57:20,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-02-14 13:57:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071275391] [2023-02-14 13:57:20,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:20,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:57:20,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:20,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:57:20,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:57:20,758 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.8) 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-14 13:57:20,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:20,784 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2023-02-14 13:57:20,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:57:20,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) 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-14 13:57:20,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:20,785 INFO L225 Difference]: With dead ends: 70 [2023-02-14 13:57:20,786 INFO L226 Difference]: Without dead ends: 70 [2023-02-14 13:57:20,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-14 13:57:20,789 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 91 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:20,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 111 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:57:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-14 13:57:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-14 13:57:20,791 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-14 13:57:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2023-02-14 13:57:20,795 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 47 [2023-02-14 13:57:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:20,796 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2023-02-14 13:57:20,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) 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-14 13:57:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2023-02-14 13:57:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 13:57:20,799 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:20,799 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-14 13:57:20,806 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-14 13:57:21,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:21,008 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-14 13:57:21,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:21,008 INFO L85 PathProgramCache]: Analyzing trace with hash 589543324, now seen corresponding path program 1 times [2023-02-14 13:57:21,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:21,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080711065] [2023-02-14 13:57:21,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:21,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:21,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:21,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:21,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:21,093 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-14 13:57:21,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:21,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080711065] [2023-02-14 13:57:21,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080711065] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:21,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:57:21,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:57:21,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416693663] [2023-02-14 13:57:21,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:21,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:57:21,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:21,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:57:21,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:57:21,096 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-14 13:57:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:21,160 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2023-02-14 13:57:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 13:57:21,160 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-14 13:57:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:21,161 INFO L225 Difference]: With dead ends: 81 [2023-02-14 13:57:21,161 INFO L226 Difference]: Without dead ends: 81 [2023-02-14 13:57:21,161 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-14 13:57:21,162 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 37 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-14 13:57:21,162 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-14 13:57:21,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-14 13:57:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2023-02-14 13:57:21,164 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-14 13:57:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2023-02-14 13:57:21,165 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 48 [2023-02-14 13:57:21,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:21,165 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2023-02-14 13:57:21,165 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-14 13:57:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2023-02-14 13:57:21,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 13:57:21,166 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:21,166 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-14 13:57:21,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-14 13:57:21,166 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-14 13:57:21,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash 589543325, now seen corresponding path program 1 times [2023-02-14 13:57:21,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:21,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184396009] [2023-02-14 13:57:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:21,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:21,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:21,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:21,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:21,663 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-14 13:57:21,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:21,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184396009] [2023-02-14 13:57:21,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184396009] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:21,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366605657] [2023-02-14 13:57:21,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:21,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:21,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:21,665 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-14 13:57:21,669 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-14 13:57:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:21,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 13:57:21,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:21,892 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-14 13:57:21,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:57:21,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366605657] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:21,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:57:21,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [18] total 20 [2023-02-14 13:57:21,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598158912] [2023-02-14 13:57:21,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:21,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:57:21,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:21,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:57:21,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2023-02-14 13:57:21,895 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-14 13:57:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:21,939 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2023-02-14 13:57:21,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:57:21,940 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-14 13:57:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:21,940 INFO L225 Difference]: With dead ends: 68 [2023-02-14 13:57:21,940 INFO L226 Difference]: Without dead ends: 68 [2023-02-14 13:57:21,941 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-14 13:57:21,941 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-14 13:57:21,942 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-14 13:57:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-02-14 13:57:21,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-02-14 13:57:21,944 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-14 13:57:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2023-02-14 13:57:21,945 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 48 [2023-02-14 13:57:21,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:21,945 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2023-02-14 13:57:21,946 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-14 13:57:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2023-02-14 13:57:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 13:57:21,947 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:21,947 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-14 13:57:21,956 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-14 13:57:22,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:22,155 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-14 13:57:22,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:22,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1095973890, now seen corresponding path program 1 times [2023-02-14 13:57:22,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:22,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780720660] [2023-02-14 13:57:22,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:22,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:22,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:22,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:22,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:22,382 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-14 13:57:22,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:22,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780720660] [2023-02-14 13:57:22,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780720660] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:22,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:57:22,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:57:22,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415812089] [2023-02-14 13:57:22,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:22,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:57:22,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:22,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:57:22,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:57:22,386 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-14 13:57:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:22,480 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2023-02-14 13:57:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:57:22,480 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-14 13:57:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:22,481 INFO L225 Difference]: With dead ends: 67 [2023-02-14 13:57:22,481 INFO L226 Difference]: Without dead ends: 67 [2023-02-14 13:57:22,481 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-14 13:57:22,482 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-14 13:57:22,482 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-14 13:57:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-14 13:57:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-02-14 13:57:22,483 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-14 13:57:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2023-02-14 13:57:22,484 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 49 [2023-02-14 13:57:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:22,484 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2023-02-14 13:57:22,484 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-14 13:57:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2023-02-14 13:57:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-14 13:57:22,487 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:22,488 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-14 13:57:22,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-14 13:57:22,488 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-14 13:57:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash 15214980, now seen corresponding path program 1 times [2023-02-14 13:57:22,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:22,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594163715] [2023-02-14 13:57:22,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:22,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:23,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:23,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:23,225 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-14 13:57:23,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:23,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594163715] [2023-02-14 13:57:23,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594163715] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:23,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615116203] [2023-02-14 13:57:23,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:23,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:23,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:23,227 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-14 13:57:23,230 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-14 13:57:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:23,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-14 13:57:23,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:23,433 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-14 13:57:23,470 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-14 13:57:23,496 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1852 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1852))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 13:57:23,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:23,524 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-14 13:57:23,559 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-14 13:57:23,565 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-14 13:57:23,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:23,664 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-14 13:57:23,903 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-14 13:57:23,906 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-14 13:57:23,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 5 treesize of output 3 [2023-02-14 13:57:24,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:24,146 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-14 13:57:24,164 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 13:57:24,164 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-14 13:57:24,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:24,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-14 13:57:24,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:24,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-02-14 13:57:24,553 INFO L321 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2023-02-14 13:57:24,553 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 40 treesize of output 35 [2023-02-14 13:57:24,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:24,786 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 13:57:24,786 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 87 treesize of output 90 [2023-02-14 13:57:24,864 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-14 13:57:25,035 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:57:25,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2023-02-14 13:57:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 12 not checked. [2023-02-14 13:57:25,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:31,499 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| Int) (v_ArrVal_1861 (Array Int Int)) (|ULTIMATE.start_sll_insert_#t~mem8#1.base| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| 4))) (or (< (select |c_#length| |ULTIMATE.start_sll_insert_#t~mem8#1.base|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| 8)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_#t~mem8#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1861) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (not (<= 0 .cse0))))) is different from false [2023-02-14 13:57:33,525 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| Int) (v_ArrVal_1861 (Array Int Int)) (|ULTIMATE.start_sll_insert_#t~mem8#1.base| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| 4))) (or (< (select |c_#length| |ULTIMATE.start_sll_insert_#t~mem8#1.base|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| 8)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_#t~mem8#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1861) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (not (<= 0 .cse0))))) is different from false [2023-02-14 13:57:33,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615116203] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:33,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:57:33,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2023-02-14 13:57:33,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406121142] [2023-02-14 13:57:33,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:33,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-14 13:57:33,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:33,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-14 13:57:33,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2258, Unknown=17, NotChecked=294, Total=2756 [2023-02-14 13:57:33,677 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 46 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 39 states have internal predecessors, (93), 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-14 13:57:36,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:36,275 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2023-02-14 13:57:36,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 13:57:36,276 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 39 states have internal predecessors, (93), 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 54 [2023-02-14 13:57:36,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:36,277 INFO L225 Difference]: With dead ends: 147 [2023-02-14 13:57:36,277 INFO L226 Difference]: Without dead ends: 147 [2023-02-14 13:57:36,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=679, Invalid=4428, Unknown=17, NotChecked=426, Total=5550 [2023-02-14 13:57:36,279 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1340 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:36,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 505 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1084 Invalid, 2 Unknown, 113 Unchecked, 0.9s Time] [2023-02-14 13:57:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-14 13:57:36,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 68. [2023-02-14 13:57:36,281 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-14 13:57:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2023-02-14 13:57:36,282 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 54 [2023-02-14 13:57:36,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:36,282 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2023-02-14 13:57:36,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 39 states have internal predecessors, (93), 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-14 13:57:36,282 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2023-02-14 13:57:36,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-14 13:57:36,283 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:36,283 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-14 13:57:36,296 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-14 13:57:36,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-14 13:57:36,491 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-14 13:57:36,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:36,491 INFO L85 PathProgramCache]: Analyzing trace with hash 15214981, now seen corresponding path program 1 times [2023-02-14 13:57:36,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:36,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359392401] [2023-02-14 13:57:36,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:36,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:37,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:37,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:37,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:37,692 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-14 13:57:37,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:37,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359392401] [2023-02-14 13:57:37,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359392401] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:37,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329302478] [2023-02-14 13:57:37,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:37,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:37,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:37,694 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-14 13:57:37,698 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-14 13:57:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:37,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-14 13:57:37,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:38,228 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-14 13:57:38,233 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-14 13:57:38,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:38,526 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-14 13:57:38,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:38,537 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-14 13:57:38,547 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 13:57:38,547 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-14 13:57:38,718 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 13:57:38,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2023-02-14 13:57:38,732 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-14 13:57:38,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 13:57:42,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:42,263 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 13:57:42,264 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 43 treesize of output 50 [2023-02-14 13:57:42,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:42,282 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 13:57:42,283 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 48 treesize of output 57 [2023-02-14 13:57:42,301 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-14 13:57:42,338 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-14 13:57:42,355 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-14 13:57:42,478 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-14 13:57:42,482 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-14 13:57:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 13:57:42,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:57:42,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329302478] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:42,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:57:42,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [23] total 39 [2023-02-14 13:57:42,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676753352] [2023-02-14 13:57:42,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:42,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-14 13:57:42,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:42,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-14 13:57:42,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1443, Unknown=0, NotChecked=0, Total=1560 [2023-02-14 13:57:42,513 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:57:47,509 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-14 13:57:47,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:47,722 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-02-14 13:57:47,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 13:57:47,723 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2023-02-14 13:57:47,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:47,724 INFO L225 Difference]: With dead ends: 91 [2023-02-14 13:57:47,724 INFO L226 Difference]: Without dead ends: 91 [2023-02-14 13:57:47,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=254, Invalid=2296, Unknown=0, NotChecked=0, Total=2550 [2023-02-14 13:57:47,725 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 484 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:47,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 345 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 454 Invalid, 2 Unknown, 0 Unchecked, 2.4s Time] [2023-02-14 13:57:47,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-14 13:57:47,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2023-02-14 13:57:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 65 states have internal predecessors, (71), 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-14 13:57:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2023-02-14 13:57:47,728 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 54 [2023-02-14 13:57:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:47,728 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2023-02-14 13:57:47,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:57:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2023-02-14 13:57:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-14 13:57:47,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:47,729 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-14 13:57:47,739 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-14 13:57:47,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:47,936 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 13:57:47,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash 471663079, now seen corresponding path program 1 times [2023-02-14 13:57:47,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:47,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592942315] [2023-02-14 13:57:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:47,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:48,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:48,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:48,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:48,978 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-14 13:57:48,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:48,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592942315] [2023-02-14 13:57:48,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592942315] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:48,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338186495] [2023-02-14 13:57:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:48,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:48,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:48,981 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-14 13:57:48,988 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-14 13:57:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:49,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-14 13:57:49,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:49,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-14 13:57:49,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:49,638 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 15 treesize of output 17 [2023-02-14 13:57:49,755 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 13:57:49,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2023-02-14 13:57:51,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:51,851 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 13:57:51,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 40 [2023-02-14 13:57:51,870 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-14 13:57:51,879 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-14 13:57:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 13:57:51,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:57:51,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338186495] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:51,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:57:51,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [24] total 38 [2023-02-14 13:57:51,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634514689] [2023-02-14 13:57:51,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:51,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 13:57:51,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:51,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 13:57:51,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1305, Unknown=1, NotChecked=0, Total=1406 [2023-02-14 13:57:51,885 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:57:58,365 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-14 13:57:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:58,514 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2023-02-14 13:57:58,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 13:57:58,514 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 55 [2023-02-14 13:57:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:58,515 INFO L225 Difference]: With dead ends: 74 [2023-02-14 13:57:58,515 INFO L226 Difference]: Without dead ends: 74 [2023-02-14 13:57:58,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=205, Invalid=2050, Unknown=1, NotChecked=0, Total=2256 [2023-02-14 13:57:58,516 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 254 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 14 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:58,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 421 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 441 Invalid, 7 Unknown, 0 Unchecked, 2.3s Time] [2023-02-14 13:57:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-14 13:57:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2023-02-14 13:57:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.25) 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-14 13:57:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2023-02-14 13:57:58,519 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 55 [2023-02-14 13:57:58,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:58,519 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2023-02-14 13:57:58,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:57:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2023-02-14 13:57:58,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-14 13:57:58,520 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:58,520 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-14 13:57:58,528 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-14 13:57:58,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:58,727 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-14 13:57:58,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:58,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1777907541, now seen corresponding path program 1 times [2023-02-14 13:57:58,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:58,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997152468] [2023-02-14 13:57:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:58,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:59,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:00,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:58:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:00,528 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-14 13:58:00,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:58:00,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997152468] [2023-02-14 13:58:00,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997152468] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:58:00,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320108363] [2023-02-14 13:58:00,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:58:00,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:58:00,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:58:00,530 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-14 13:58:00,539 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-14 13:58:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:00,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 112 conjunts are in the unsatisfiable core [2023-02-14 13:58:00,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:58:00,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:58:01,082 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-14 13:58:01,396 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-14 13:58:01,401 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-14 13:58:01,407 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-14 13:58:01,413 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-14 13:58:01,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:01,692 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 42 treesize of output 33 [2023-02-14 13:58:01,705 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:58:01,705 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-14 13:58:01,712 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 19 [2023-02-14 13:58:01,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:01,716 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 38 treesize of output 29 [2023-02-14 13:58:02,211 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:58:02,211 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 93 treesize of output 84 [2023-02-14 13:58:02,219 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-14 13:58:02,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:02,233 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 55 treesize of output 41 [2023-02-14 13:58:02,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:02,314 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 39 treesize of output 37 [2023-02-14 13:58:02,330 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-14 13:58:02,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:02,337 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-14 13:58:02,423 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 32 treesize of output 20 [2023-02-14 13:58:02,427 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-14 13:58:02,567 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-14 13:58:02,610 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-14 13:58:02,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:58:02,626 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (v_ArrVal_2435 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2437) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2436) |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_2435) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-14 13:58:13,895 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2430 Int) (v_ArrVal_2436 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_2447)) (.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_2448))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2 (+ (select (select .cse4 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_2449))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2430))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_2437) (select (select (store (store .cse3 .cse1 v_ArrVal_2432) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_2436) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_2433)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_2435) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)))) is different from false [2023-02-14 13:58:13,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320108363] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:58:13,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:58:13,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2023-02-14 13:58:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544732419] [2023-02-14 13:58:13,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:58:13,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-14 13:58:13,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:58:13,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-14 13:58:13,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2329, Unknown=161, NotChecked=202, Total=2862 [2023-02-14 13:58:13,901 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 47 states, 45 states have (on average 2.022222222222222) internal successors, (91), 41 states have internal predecessors, (91), 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-14 13:58:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:58:25,861 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2023-02-14 13:58:25,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 13:58:25,862 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 2.022222222222222) internal successors, (91), 41 states have internal predecessors, (91), 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 58 [2023-02-14 13:58:25,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:58:25,865 INFO L225 Difference]: With dead ends: 116 [2023-02-14 13:58:25,865 INFO L226 Difference]: Without dead ends: 116 [2023-02-14 13:58:25,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=491, Invalid=4893, Unknown=174, NotChecked=294, Total=5852 [2023-02-14 13:58:25,867 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 388 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-14 13:58:25,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 738 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-14 13:58:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-14 13:58:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 79. [2023-02-14 13:58:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 74 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-14 13:58:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2023-02-14 13:58:25,870 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 58 [2023-02-14 13:58:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:58:25,870 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2023-02-14 13:58:25,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 2.022222222222222) internal successors, (91), 41 states have internal predecessors, (91), 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-14 13:58:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2023-02-14 13:58:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-14 13:58:25,871 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:58:25,871 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-14 13:58:25,880 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-14 13:58:26,077 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,SelfDestructingSolverStorable20 [2023-02-14 13:58:26,078 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-14 13:58:26,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:58:26,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1527316149, now seen corresponding path program 1 times [2023-02-14 13:58:26,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:58:26,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462207987] [2023-02-14 13:58:26,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:58:26,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:58:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:26,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:58:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:26,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:58:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:58:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:26,602 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-14 13:58:26,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:58:26,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462207987] [2023-02-14 13:58:26,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462207987] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:58:26,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630508963] [2023-02-14 13:58:26,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:58:26,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:58:26,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:58:26,605 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-14 13:58:26,607 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-14 13:58:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:26,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 13:58:26,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:58:26,865 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-14 13:58:26,908 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2629 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2629))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-02-14 13:58:26,929 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-14 13:58:26,944 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2630 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2630))))) is different from true [2023-02-14 13:58:26,965 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-14 13:58:26,981 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2631 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2631))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-02-14 13:58:27,003 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-14 13:58:27,008 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-14 13:58:27,038 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:58:27,038 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-14 13:58:27,060 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-14 13:58:27,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:58:27,608 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-14 13:58:27,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630508963] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:58:27,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:58:27,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 7] total 30 [2023-02-14 13:58:27,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060334879] [2023-02-14 13:58:27,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:58:27,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-14 13:58:27,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:58:27,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-14 13:58:27,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=623, Unknown=3, NotChecked=156, Total=870 [2023-02-14 13:58:27,610 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 27 states have internal predecessors, (108), 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-14 13:58:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:58:28,303 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2023-02-14 13:58:28,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-14 13:58:28,305 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 27 states have internal predecessors, (108), 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 58 [2023-02-14 13:58:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:58:28,306 INFO L225 Difference]: With dead ends: 70 [2023-02-14 13:58:28,306 INFO L226 Difference]: Without dead ends: 70 [2023-02-14 13:58:28,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 101 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=334, Invalid=1567, Unknown=3, NotChecked=258, Total=2162 [2023-02-14 13:58:28,307 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 305 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:58:28,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 333 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 458 Invalid, 0 Unknown, 186 Unchecked, 0.3s Time] [2023-02-14 13:58:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-14 13:58:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-14 13:58:28,309 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-14 13:58:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2023-02-14 13:58:28,310 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 58 [2023-02-14 13:58:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:58:28,310 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2023-02-14 13:58:28,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 27 states have internal predecessors, (108), 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-14 13:58:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2023-02-14 13:58:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-14 13:58:28,311 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:58:28,311 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-14 13:58:28,317 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-14 13:58:28,517 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,SelfDestructingSolverStorable21 [2023-02-14 13:58:28,518 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-14 13:58:28,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:58:28,518 INFO L85 PathProgramCache]: Analyzing trace with hash 719441558, now seen corresponding path program 1 times [2023-02-14 13:58:28,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:58:28,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906976313] [2023-02-14 13:58:28,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:58:28,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:58:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:29,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:58:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:29,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:58:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:29,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:58:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:30,122 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-14 13:58:30,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:58:30,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906976313] [2023-02-14 13:58:30,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906976313] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:58:30,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84019314] [2023-02-14 13:58:30,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:58:30,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:58:30,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:58:30,123 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-14 13:58:30,125 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-14 13:58:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:30,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 98 conjunts are in the unsatisfiable core [2023-02-14 13:58:30,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:58:30,807 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-14 13:58:30,810 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-14 13:58:30,813 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-14 13:58:31,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:31,161 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-14 13:58:31,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:31,175 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-14 13:58:31,198 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 13:58:31,198 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-14 13:58:31,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:31,687 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-14 13:58:31,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:31,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2023-02-14 13:58:31,797 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 13:58:31,797 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-14 13:58:31,812 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:58:31,812 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-14 13:58:31,941 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-14 13:58:32,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:32,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:58:32,134 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-14 13:58:32,319 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-14 13:58:32,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:58:32,510 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2828 (Array Int Int)) (v_ArrVal_2827 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2827))) (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_2828) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2023-02-14 13:58:32,526 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2824 (Array Int Int)) (v_ArrVal_2828 (Array Int Int)) (v_ArrVal_2827 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~snd_to_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_2827))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2824) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2828) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 1)) is different from false [2023-02-14 13:58:32,547 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2824 (Array Int Int)) (v_ArrVal_2828 (Array Int Int)) (v_ArrVal_2827 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (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_2827))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2824) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2828) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2023-02-14 13:58:32,556 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2824 (Array Int Int)) (v_ArrVal_2828 (Array Int Int)) (v_ArrVal_2827 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|) (+ |c_ULTIMATE.start_sll_insert_#t~mem8#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_2827))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2824) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2828) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2023-02-14 13:58:32,564 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2824 (Array Int Int)) (v_ArrVal_2828 (Array Int Int)) (v_ArrVal_2827 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ (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_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2827))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2824) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2828) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) 1)) is different from false [2023-02-14 13:58:32,574 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2824 (Array Int Int)) (v_ArrVal_2828 (Array Int Int)) (v_ArrVal_2827 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ (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_2827))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2824) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2828) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) 1)) is different from false [2023-02-14 13:58:32,648 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2836 (Array Int Int)) (v_ArrVal_2824 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_28| Int) (v_ArrVal_2828 (Array Int Int)) (v_ArrVal_2827 (Array Int Int)) (v_ArrVal_2837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_28|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_28| 1) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_28| v_ArrVal_2837))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_28| v_ArrVal_2836)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (let ((.cse0 (store (store .cse1 .cse2 (store (select .cse1 .cse2) (+ 4 (select (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_28|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_28| v_ArrVal_2827))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store .cse3 .cse2 v_ArrVal_2824) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_28| v_ArrVal_2828) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) 1))) is different from false [2023-02-14 13:58:32,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84019314] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:58:32,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:58:32,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2023-02-14 13:58:32,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093743415] [2023-02-14 13:58:32,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:58:32,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-02-14 13:58:32,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:58:32,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-02-14 13:58:32,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3029, Unknown=8, NotChecked=812, Total=4032 [2023-02-14 13:58:32,653 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 47 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-14 13:58:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:58:36,226 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2023-02-14 13:58:36,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-14 13:58:36,226 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.94) internal successors, (97), 47 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-14 13:58:36,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:58:36,227 INFO L225 Difference]: With dead ends: 105 [2023-02-14 13:58:36,227 INFO L226 Difference]: Without dead ends: 105 [2023-02-14 13:58:36,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=655, Invalid=5525, Unknown=10, NotChecked=1120, Total=7310 [2023-02-14 13:58:36,229 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 959 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:58:36,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 666 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1556 Invalid, 2 Unknown, 0 Unchecked, 1.1s Time] [2023-02-14 13:58:36,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-14 13:58:36,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2023-02-14 13:58:36,231 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-14 13:58:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2023-02-14 13:58:36,232 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 59 [2023-02-14 13:58:36,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:58:36,232 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2023-02-14 13:58:36,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.94) internal successors, (97), 47 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-14 13:58:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2023-02-14 13:58:36,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-14 13:58:36,233 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:58:36,233 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-14 13:58:36,240 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-14 13:58:36,440 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,SelfDestructingSolverStorable22 [2023-02-14 13:58:36,440 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-14 13:58:36,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:58:36,441 INFO L85 PathProgramCache]: Analyzing trace with hash 719441559, now seen corresponding path program 1 times [2023-02-14 13:58:36,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:58:36,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684437160] [2023-02-14 13:58:36,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:58:36,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:58:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:38,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:58:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:58:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:58:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:38,653 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-14 13:58:38,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:58:38,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684437160] [2023-02-14 13:58:38,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684437160] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:58:38,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497971066] [2023-02-14 13:58:38,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:58:38,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:58:38,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:58:38,656 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-14 13:58:38,657 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-14 13:58:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:38,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 113 conjunts are in the unsatisfiable core [2023-02-14 13:58:38,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:58:39,387 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-14 13:58:39,392 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-14 13:58:39,395 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-14 13:58:39,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:39,732 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-14 13:58:39,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:39,748 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-14 13:58:39,763 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:58:39,764 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-14 13:58:40,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:40,282 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-14 13:58:40,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:40,290 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-14 13:58:40,382 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 13:58:40,383 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-14 13:58:40,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:40,407 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-14 13:58:40,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 108 [2023-02-14 13:58:40,790 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:58:40,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:40,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:58:40,794 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 113 treesize of output 51 [2023-02-14 13:58:40,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:40,803 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-14 13:58:40,803 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-14 13:58:41,021 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-14 13:58:41,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:58:41,503 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3025 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3025))) (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_3024 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3024))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 .cse0))) (<= (+ (select (select .cse1 .cse2) .cse3) 8) (select |c_#length| (select (select .cse4 .cse2) .cse3)))))))))) (forall ((v_ArrVal_3025 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3025))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse5)) (forall ((v_ArrVal_3024 (Array Int Int))) (<= 0 (+ (select (select .cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3024) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse5)) 4)))))))) is different from false [2023-02-14 13:58:41,529 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_3025 (Array Int Int))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3025))) (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_3024 (Array Int Int))) (<= 0 (+ (select (select .cse1 (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3024) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse0 4)) 4))))))) (forall ((v_ArrVal_3025 (Array Int Int))) (let ((.cse5 (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3025))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4)) (forall ((v_ArrVal_3024 (Array Int Int))) (let ((.cse8 (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3024))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ .cse4 4))) (<= (+ 8 (select (select .cse5 .cse6) .cse7)) (select |c_#length| (select (select .cse8 .cse6) .cse7))))))))))))) is different from false [2023-02-14 13:58:41,626 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (let ((.cse2 (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|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_3025 (Array Int Int))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3025))) (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_3024 (Array Int Int))) (<= 0 (+ 4 (select (select .cse1 (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3024) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse0))))))))) (forall ((v_ArrVal_3025 (Array Int Int))) (let ((.cse5 (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3025))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4)) (forall ((v_ArrVal_3024 (Array Int Int))) (let ((.cse8 (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3024))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ 4 .cse4))) (<= (+ 8 (select (select .cse5 .cse6) .cse7)) (select |c_#length| (select (select .cse8 .cse6) .cse7))))))))))))) is different from false [2023-02-14 13:58:41,938 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse10 (+ (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| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (.cse6 (store |c_#memory_$Pointer$.offset| .cse9 (store (select |c_#memory_$Pointer$.offset| .cse9) .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_3025 (Array Int Int))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3025))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3024 (Array Int Int))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3024))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 .cse4))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse4)))))) (forall ((v_ArrVal_3025 (Array Int Int))) (let ((.cse8 (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3025))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_3024 (Array Int Int))) (<= 0 (+ (select (select .cse8 (select (select (store .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3024) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse7)) 4)))))))))) is different from false [2023-02-14 13:58:42,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:58:42,451 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 520 treesize of output 524 [2023-02-14 13:58:49,153 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 13:58:49,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497971066] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:58:49,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:58:49,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 27] total 59 [2023-02-14 13:58:49,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888421566] [2023-02-14 13:58:49,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:58:49,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-02-14 13:58:49,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:58:49,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-02-14 13:58:49,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=4571, Unknown=37, NotChecked=556, Total=5402 [2023-02-14 13:58:49,158 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 60 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 53 states have internal predecessors, (103), 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-14 13:58:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:58:55,085 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2023-02-14 13:58:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-14 13:58:55,086 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 53 states have internal predecessors, (103), 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-14 13:58:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:58:55,086 INFO L225 Difference]: With dead ends: 120 [2023-02-14 13:58:55,087 INFO L226 Difference]: Without dead ends: 120 [2023-02-14 13:58:55,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2122 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=733, Invalid=8752, Unknown=37, NotChecked=780, Total=10302 [2023-02-14 13:58:55,089 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1233 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-14 13:58:55,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 810 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-14 13:58:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-14 13:58:55,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 74. [2023-02-14 13:58:55,091 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-14 13:58:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-02-14 13:58:55,092 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 59 [2023-02-14 13:58:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:58:55,092 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-02-14 13:58:55,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 53 states have internal predecessors, (103), 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-14 13:58:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-02-14 13:58:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-14 13:58:55,093 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:58:55,094 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-14 13:58:55,099 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-14 13:58:55,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:58:55,297 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-14 13:58:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:58:55,297 INFO L85 PathProgramCache]: Analyzing trace with hash 827850517, now seen corresponding path program 1 times [2023-02-14 13:58:55,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:58:55,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6910708] [2023-02-14 13:58:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:58:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:58:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:56,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:58:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:56,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:58:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:56,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:58:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:57,058 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-14 13:58:57,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:58:57,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6910708] [2023-02-14 13:58:57,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6910708] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:58:57,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204369510] [2023-02-14 13:58:57,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:58:57,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:58:57,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:58:57,060 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-14 13:58:57,062 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-14 13:58:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:57,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 96 conjunts are in the unsatisfiable core [2023-02-14 13:58:57,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:58:57,405 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-14 13:58:57,921 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-14 13:58:57,926 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-14 13:58:57,933 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-14 13:58:58,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:58,199 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 27 treesize of output 20 [2023-02-14 13:58:58,214 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:58:58,214 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-14 13:58:58,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:58,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-02-14 13:58:58,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:58,794 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 53 treesize of output 39 [2023-02-14 13:58:58,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:58,805 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-14 13:58:58,976 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 13:58:58,976 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-14 13:58:58,998 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:58:58,998 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 94 treesize of output 89 [2023-02-14 13:58:59,159 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 81 treesize of output 57 [2023-02-14 13:58:59,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:59,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:58:59,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 25 [2023-02-14 13:58:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:58:59,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:58:59,584 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3220))) (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_3221) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2023-02-14 13:59:00,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204369510] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:59:00,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:59:00,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 47 [2023-02-14 13:59:00,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22374795] [2023-02-14 13:59:00,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:59:00,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-14 13:59:00,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:59:00,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-14 13:59:00,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2899, Unknown=13, NotChecked=108, Total=3192 [2023-02-14 13:59:00,469 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 47 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 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-14 13:59:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:59:03,556 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2023-02-14 13:59:03,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-14 13:59:03,556 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 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 60 [2023-02-14 13:59:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:59:03,557 INFO L225 Difference]: With dead ends: 89 [2023-02-14 13:59:03,557 INFO L226 Difference]: Without dead ends: 89 [2023-02-14 13:59:03,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=530, Invalid=5467, Unknown=13, NotChecked=152, Total=6162 [2023-02-14 13:59:03,559 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 604 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-14 13:59:03,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 687 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-14 13:59:03,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-14 13:59:03,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 74. [2023-02-14 13:59:03,561 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-14 13:59:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2023-02-14 13:59:03,562 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 60 [2023-02-14 13:59:03,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:59:03,562 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2023-02-14 13:59:03,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 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-14 13:59:03,562 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2023-02-14 13:59:03,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-14 13:59:03,563 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:59:03,563 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-14 13:59:03,573 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-14 13:59:03,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:59:03,770 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-14 13:59:03,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:59:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash 832836797, now seen corresponding path program 1 times [2023-02-14 13:59:03,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:59:03,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248658057] [2023-02-14 13:59:03,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:59:03,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:59:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:05,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:59:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:05,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:59:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:05,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:59:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:05,956 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-14 13:59:05,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:59:05,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248658057] [2023-02-14 13:59:05,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248658057] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:59:05,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985123203] [2023-02-14 13:59:05,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:59:05,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:59:05,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:59:05,959 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-14 13:59:05,961 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-14 13:59:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:06,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 133 conjunts are in the unsatisfiable core [2023-02-14 13:59:06,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:59:06,266 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-14 13:59:06,735 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-14 13:59:06,741 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-14 13:59:06,746 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-14 13:59:06,939 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-14 13:59:07,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:07,124 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-14 13:59:07,141 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:59:07,141 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-14 13:59:07,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:07,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-02-14 13:59:07,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:07,780 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-14 13:59:07,786 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-14 13:59:07,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:07,798 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-14 13:59:07,947 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 13:59:07,948 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 184 treesize of output 151 [2023-02-14 13:59:07,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:07,984 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-14 13:59:07,985 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 169 treesize of output 153 [2023-02-14 13:59:08,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:08,003 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 77 treesize of output 62 [2023-02-14 13:59:08,449 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:59:08,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:08,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:59:08,452 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 115 treesize of output 53 [2023-02-14 13:59:08,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:08,462 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-14 13:59:08,462 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-14 13:59:08,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 15 treesize of output 7 [2023-02-14 13:59:08,758 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-14 13:59:08,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:59:09,148 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int)) (v_ArrVal_3420 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3422))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3421))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 .cse4))) (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_3420)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) (not (<= 0 .cse4)))))) is different from false [2023-02-14 13:59:10,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:59:10,580 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-14 13:59:10,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:59:10,610 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 3128 treesize of output 2992 [2023-02-14 13:59:10,622 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 3400 treesize of output 2856 [2023-02-14 13:59:11,289 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 2000 treesize of output 1728 [2023-02-14 13:59:12,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:59:12,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 3673 treesize of output 11311