./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 7e1ff0e6 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-?-7e1ff0e [2023-02-15 01:38:51,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:38:51,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:38:51,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:38:51,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:38:51,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:38:51,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:38:51,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:38:51,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:38:51,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:38:51,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:38:51,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:38:51,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:38:51,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:38:51,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:38:51,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:38:51,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:38:51,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:38:51,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:38:51,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:38:51,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:38:51,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:38:51,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:38:51,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:38:51,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:38:51,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:38:51,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:38:51,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:38:51,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:38:51,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:38:51,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:38:51,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:38:51,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:38:51,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:38:51,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:38:51,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:38:51,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:38:51,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:38:51,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:38:51,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:38:51,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:38:51,309 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:38:51,333 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:38:51,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:38:51,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:38:51,335 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:38:51,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:38:51,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:38:51,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:38:51,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:38:51,336 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:38:51,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:38:51,337 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:38:51,337 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:38:51,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:38:51,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:38:51,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:38:51,338 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:38:51,338 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:38:51,338 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:38:51,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:38:51,338 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:38:51,338 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:38:51,338 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:38:51,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:38:51,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:38:51,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:38:51,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:38:51,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:38:51,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:38:51,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:38:51,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:38:51,340 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:38:51,341 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:38:51,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:38:51,341 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:38:51,341 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2023-02-15 01:38:51,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:38:51,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:38:51,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:38:51,593 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:38:51,593 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:38:51,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-02-15 01:38:52,723 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:38:52,931 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:38:52,932 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-02-15 01:38:52,942 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9e71681/cf205c9439e04cebaab54b24c00ce527/FLAG234286fd0 [2023-02-15 01:38:52,956 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9e71681/cf205c9439e04cebaab54b24c00ce527 [2023-02-15 01:38:52,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:38:52,959 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:38:52,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:38:52,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:38:52,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:38:52,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:38:52" (1/1) ... [2023-02-15 01:38:52,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7522bcb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:52, skipping insertion in model container [2023-02-15 01:38:52,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:38:52" (1/1) ... [2023-02-15 01:38:52,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:38:53,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:38:53,230 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2023-02-15 01:38:53,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:38:53,244 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:38:53,290 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2023-02-15 01:38:53,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:38:53,314 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:38:53,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:53 WrapperNode [2023-02-15 01:38:53,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:38:53,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:38:53,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:38:53,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:38:53,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:53" (1/1) ... [2023-02-15 01:38:53,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:53" (1/1) ... [2023-02-15 01:38:53,350 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2023-02-15 01:38:53,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:38:53,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:38:53,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:38:53,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:38:53,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:53" (1/1) ... [2023-02-15 01:38:53,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:53" (1/1) ... [2023-02-15 01:38:53,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:53" (1/1) ... [2023-02-15 01:38:53,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:53" (1/1) ... [2023-02-15 01:38:53,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:53" (1/1) ... [2023-02-15 01:38:53,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:53" (1/1) ... [2023-02-15 01:38:53,370 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:53" (1/1) ... [2023-02-15 01:38:53,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:53" (1/1) ... [2023-02-15 01:38:53,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:38:53,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:38:53,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:38:53,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:38:53,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:53" (1/1) ... [2023-02-15 01:38:53,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:38:53,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:53,418 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 01:38:53,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 01:38:53,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 01:38:53,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 01:38:53,449 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 01:38:53,449 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 01:38:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:38:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:38:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 01:38:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:38:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:38:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:38:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 01:38:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:38:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:38:53,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:38:53,537 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:38:53,539 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:38:53,839 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:38:53,844 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:38:53,844 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 01:38:53,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:38:53 BoogieIcfgContainer [2023-02-15 01:38:53,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:38:53,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:38:53,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:38:53,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:38:53,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:38:52" (1/3) ... [2023-02-15 01:38:53,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b3acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:38:53, skipping insertion in model container [2023-02-15 01:38:53,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:53" (2/3) ... [2023-02-15 01:38:53,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b3acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:38:53, skipping insertion in model container [2023-02-15 01:38:53,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:38:53" (3/3) ... [2023-02-15 01:38:53,851 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2023-02-15 01:38:53,862 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:38:53,863 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-02-15 01:38:53,896 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:38:53,900 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;@4b5c9848, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:38:53,901 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-02-15 01:38:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 78 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:53,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 01:38:53,907 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:53,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:53,908 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:38:53,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1813843193, now seen corresponding path program 1 times [2023-02-15 01:38:53,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:53,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5766189] [2023-02-15 01:38:53,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:53,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:38:54,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:54,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5766189] [2023-02-15 01:38:54,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5766189] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:54,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:54,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:38:54,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679421830] [2023-02-15 01:38:54,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:54,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:38:54,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:54,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:38:54,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:38:54,137 INFO L87 Difference]: Start difference. First operand has 82 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 78 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:38:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:54,219 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2023-02-15 01:38:54,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:38:54,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 01:38:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:54,242 INFO L225 Difference]: With dead ends: 80 [2023-02-15 01:38:54,242 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 01:38:54,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:38:54,250 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:54,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 126 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:38:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 01:38:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-15 01:38:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-15 01:38:54,296 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 7 [2023-02-15 01:38:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:54,297 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-15 01:38:54,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:38:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-15 01:38:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 01:38:54,297 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:54,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:54,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:38:54,298 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:38:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:54,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1813843194, now seen corresponding path program 1 times [2023-02-15 01:38:54,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:54,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714016824] [2023-02-15 01:38:54,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:54,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:38:54,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:54,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714016824] [2023-02-15 01:38:54,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714016824] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:54,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:54,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:38:54,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481892342] [2023-02-15 01:38:54,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:54,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:38:54,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:54,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:38:54,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:38:54,386 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:38:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:54,427 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2023-02-15 01:38:54,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:38:54,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 01:38:54,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:54,430 INFO L225 Difference]: With dead ends: 75 [2023-02-15 01:38:54,431 INFO L226 Difference]: Without dead ends: 75 [2023-02-15 01:38:54,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:38:54,434 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-15 01:38:54,434 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-15 01:38:54,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-15 01:38:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-02-15 01:38:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.711111111111111) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2023-02-15 01:38:54,446 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 7 [2023-02-15 01:38:54,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:54,447 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2023-02-15 01:38:54,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:38:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2023-02-15 01:38:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 01:38:54,448 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:54,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:54,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:38:54,449 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:38:54,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:54,450 INFO L85 PathProgramCache]: Analyzing trace with hash 649951808, now seen corresponding path program 1 times [2023-02-15 01:38:54,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:54,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763747094] [2023-02-15 01:38:54,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:54,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:54,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:38:54,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:54,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763747094] [2023-02-15 01:38:54,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763747094] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:54,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:54,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:38:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942816416] [2023-02-15 01:38:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:54,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:38:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:54,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:38:54,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:38:54,576 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:38:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:54,731 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2023-02-15 01:38:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:38:54,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-15 01:38:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:54,735 INFO L225 Difference]: With dead ends: 79 [2023-02-15 01:38:54,735 INFO L226 Difference]: Without dead ends: 79 [2023-02-15 01:38:54,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:38:54,736 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-15 01:38:54,737 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-15 01:38:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-15 01:38:54,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2023-02-15 01:38:54,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-02-15 01:38:54,745 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 13 [2023-02-15 01:38:54,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:54,745 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-02-15 01:38:54,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:38:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-02-15 01:38:54,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 01:38:54,746 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:54,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:54,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:38:54,747 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:38:54,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:54,747 INFO L85 PathProgramCache]: Analyzing trace with hash 649951809, now seen corresponding path program 1 times [2023-02-15 01:38:54,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:54,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810328393] [2023-02-15 01:38:54,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:54,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:54,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:38:55,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:55,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810328393] [2023-02-15 01:38:55,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810328393] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:55,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:55,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:38:55,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593434359] [2023-02-15 01:38:55,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:55,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:38:55,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:55,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:38:55,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:38:55,004 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:38:55,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:55,136 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2023-02-15 01:38:55,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:38:55,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-15 01:38:55,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:55,139 INFO L225 Difference]: With dead ends: 78 [2023-02-15 01:38:55,139 INFO L226 Difference]: Without dead ends: 78 [2023-02-15 01:38:55,139 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-15 01:38:55,147 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 9 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:55,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 309 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:38:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-15 01:38:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2023-02-15 01:38:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 69 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2023-02-15 01:38:55,160 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 13 [2023-02-15 01:38:55,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:55,160 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2023-02-15 01:38:55,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:38:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2023-02-15 01:38:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 01:38:55,161 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:55,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:55,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:38:55,162 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:38:55,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:55,162 INFO L85 PathProgramCache]: Analyzing trace with hash 87749440, now seen corresponding path program 1 times [2023-02-15 01:38:55,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:55,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800984874] [2023-02-15 01:38:55,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:55,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 01:38:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:38:55,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:55,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800984874] [2023-02-15 01:38:55,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800984874] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:55,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:55,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:38:55,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341311066] [2023-02-15 01:38:55,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:55,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:38:55,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:55,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:38:55,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:38:55,240 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:38:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:55,291 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2023-02-15 01:38:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:38:55,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-15 01:38:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:55,293 INFO L225 Difference]: With dead ends: 79 [2023-02-15 01:38:55,293 INFO L226 Difference]: Without dead ends: 79 [2023-02-15 01:38:55,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:38:55,293 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-15 01:38:55,294 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-15 01:38:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-15 01:38:55,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2023-02-15 01:38:55,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-02-15 01:38:55,311 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 15 [2023-02-15 01:38:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:55,311 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-02-15 01:38:55,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:38:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-02-15 01:38:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 01:38:55,312 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:55,312 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:55,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:38:55,313 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:38:55,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:55,313 INFO L85 PathProgramCache]: Analyzing trace with hash -847170750, now seen corresponding path program 1 times [2023-02-15 01:38:55,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:55,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931750587] [2023-02-15 01:38:55,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:55,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:55,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:38:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:55,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 01:38:55,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:55,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931750587] [2023-02-15 01:38:55,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931750587] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:55,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950874921] [2023-02-15 01:38:55,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:55,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:55,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:55,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:38:55,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 01:38:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:55,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:38:55,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:38:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:38:55,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:38:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 01:38:55,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950874921] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:38:55,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:38:55,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-15 01:38:55,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920853282] [2023-02-15 01:38:55,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:38:55,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:38:55,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:55,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:38:55,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:38:55,595 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:38:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:55,642 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2023-02-15 01:38:55,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:38:55,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2023-02-15 01:38:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:55,644 INFO L225 Difference]: With dead ends: 80 [2023-02-15 01:38:55,644 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 01:38:55,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:38:55,644 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:55,645 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.0s Time] [2023-02-15 01:38:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 01:38:55,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-15 01:38:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.588235294117647) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:38:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2023-02-15 01:38:55,648 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 28 [2023-02-15 01:38:55,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:55,648 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2023-02-15 01:38:55,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:38:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2023-02-15 01:38:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 01:38:55,649 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:55,649 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:55,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 01:38:55,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 01:38:55,855 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:38:55,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:55,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1562281600, now seen corresponding path program 2 times [2023-02-15 01:38:55,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:55,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320357718] [2023-02-15 01:38:55,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:55,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:56,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:56,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:38:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:56,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:38:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 01:38:56,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:56,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320357718] [2023-02-15 01:38:56,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320357718] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:56,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:56,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:38:56,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564328937] [2023-02-15 01:38:56,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:56,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:38:56,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:56,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:38:56,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:38:56,191 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:56,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:56,301 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2023-02-15 01:38:56,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:38:56,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2023-02-15 01:38:56,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:56,302 INFO L225 Difference]: With dead ends: 88 [2023-02-15 01:38:56,303 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 01:38:56,303 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-15 01:38:56,303 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 106 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:56,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 136 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:38:56,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 01:38:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2023-02-15 01:38:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 71 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:38:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2023-02-15 01:38:56,307 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 41 [2023-02-15 01:38:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:56,307 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2023-02-15 01:38:56,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2023-02-15 01:38:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 01:38:56,308 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:56,308 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:56,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 01:38:56,309 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:38:56,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:56,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1562281601, now seen corresponding path program 1 times [2023-02-15 01:38:56,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:56,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647851515] [2023-02-15 01:38:56,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:56,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:56,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:56,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:38:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:56,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:38:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:56,883 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-15 01:38:56,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:56,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647851515] [2023-02-15 01:38:56,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647851515] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:56,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689176056] [2023-02-15 01:38:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:56,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:56,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:56,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:38:56,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 01:38:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:56,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 01:38:57,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:38:57,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:38:57,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:38:57,092 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-15 01:38:57,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:57,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:38:57,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:38:57,175 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-15 01:38:57,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:57,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:38:57,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:38:57,258 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-15 01:38:57,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:57,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:38:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2023-02-15 01:38:57,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:38:57,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689176056] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:57,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:38:57,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-02-15 01:38:57,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892572139] [2023-02-15 01:38:57,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:38:57,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 01:38:57,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:57,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 01:38:57,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=225, Unknown=3, NotChecked=96, Total=380 [2023-02-15 01:38:57,364 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-15 01:38:57,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:57,590 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2023-02-15 01:38:57,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:38:57,591 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-15 01:38:57,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:57,592 INFO L225 Difference]: With dead ends: 84 [2023-02-15 01:38:57,592 INFO L226 Difference]: Without dead ends: 84 [2023-02-15 01:38:57,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=341, Unknown=3, NotChecked=120, Total=552 [2023-02-15 01:38:57,592 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 245 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:57,592 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.1s Time] [2023-02-15 01:38:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-15 01:38:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2023-02-15 01:38:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:38:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2023-02-15 01:38:57,595 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 41 [2023-02-15 01:38:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:57,596 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2023-02-15 01:38:57,596 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-15 01:38:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2023-02-15 01:38:57,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 01:38:57,615 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:57,615 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:57,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 01:38:57,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-15 01:38:57,821 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:38:57,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:57,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1665526433, now seen corresponding path program 1 times [2023-02-15 01:38:57,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:57,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382678239] [2023-02-15 01:38:57,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:57,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:58,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:38:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:58,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:38:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 01:38:58,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:58,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382678239] [2023-02-15 01:38:58,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382678239] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:58,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016709388] [2023-02-15 01:38:58,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:58,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:58,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:58,294 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:38:58,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 01:38:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:58,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 01:38:58,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:38:58,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:38:58,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 01:38:58,706 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-15 01:38:58,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:58,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:38:58,744 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-02-15 01:38:58,744 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-15 01:38:58,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 01:38:58,774 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-15 01:38:58,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:38:58,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016709388] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:58,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:38:58,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2023-02-15 01:38:58,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062983312] [2023-02-15 01:38:58,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:38:58,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 01:38:58,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:58,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 01:38:58,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2023-02-15 01:38:58,849 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-15 01:38:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:59,315 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2023-02-15 01:38:59,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 01:38:59,315 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-15 01:38:59,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:59,316 INFO L225 Difference]: With dead ends: 124 [2023-02-15 01:38:59,316 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 01:38:59,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=1064, Unknown=1, NotChecked=68, Total=1332 [2023-02-15 01:38:59,317 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 594 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:59,317 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.3s Time] [2023-02-15 01:38:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 01:38:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2023-02-15 01:38:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 69 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:38:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2023-02-15 01:38:59,320 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 44 [2023-02-15 01:38:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:59,320 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-02-15 01:38:59,321 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-15 01:38:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2023-02-15 01:38:59,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 01:38:59,321 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:59,321 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:59,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 01:38:59,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:59,522 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:38:59,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1665526434, now seen corresponding path program 1 times [2023-02-15 01:38:59,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:59,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040114837] [2023-02-15 01:38:59,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:59,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:59,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:59,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:38:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:00,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:39:00,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:00,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040114837] [2023-02-15 01:39:00,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040114837] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:00,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100642152] [2023-02-15 01:39:00,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:00,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:00,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:00,301 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:39:00,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 01:39:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:00,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 01:39:00,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:00,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:39:00,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:39:00,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:39:00,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 01:39:00,885 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-15 01:39:00,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:00,911 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-15 01:39:00,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:00,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 01:39:00,927 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:39:00,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:39:00,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-02-15 01:39:00,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-15 01:39:00,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 01:39:01,019 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-15 01:39:01,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:01,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100642152] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:01,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:39:01,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2023-02-15 01:39:01,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951494867] [2023-02-15 01:39:01,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:01,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 01:39:01,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:01,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 01:39:01,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1085, Unknown=1, NotChecked=66, Total=1260 [2023-02-15 01:39:01,741 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-15 01:39:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:02,764 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2023-02-15 01:39:02,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 01:39:02,764 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-15 01:39:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:02,765 INFO L225 Difference]: With dead ends: 114 [2023-02-15 01:39:02,765 INFO L226 Difference]: Without dead ends: 114 [2023-02-15 01:39:02,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=228, Invalid=1937, Unknown=1, NotChecked=90, Total=2256 [2023-02-15 01:39:02,766 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-15 01:39:02,766 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-15 01:39:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-15 01:39:02,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 74. [2023-02-15 01:39:02,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 69 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2023-02-15 01:39:02,768 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 44 [2023-02-15 01:39:02,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:02,769 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2023-02-15 01:39:02,769 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-15 01:39:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2023-02-15 01:39:02,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 01:39:02,769 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:02,769 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:02,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 01:39:02,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:02,975 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:39:02,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:02,976 INFO L85 PathProgramCache]: Analyzing trace with hash 91710248, now seen corresponding path program 1 times [2023-02-15 01:39:02,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:02,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814847824] [2023-02-15 01:39:02,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:03,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:03,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:03,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 01:39:03,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:03,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814847824] [2023-02-15 01:39:03,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814847824] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:39:03,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:39:03,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:39:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15598193] [2023-02-15 01:39:03,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:39:03,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:39:03,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:03,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:39:03,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:39:03,051 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:39:03,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:03,094 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2023-02-15 01:39:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:39:03,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-02-15 01:39:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:03,096 INFO L225 Difference]: With dead ends: 109 [2023-02-15 01:39:03,096 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 01:39:03,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:39:03,097 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 38 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:03,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:39:03,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 01:39:03,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2023-02-15 01:39:03,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 70 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2023-02-15 01:39:03,101 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 45 [2023-02-15 01:39:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:03,101 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2023-02-15 01:39:03,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:39:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2023-02-15 01:39:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:39:03,104 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:03,105 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:03,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 01:39:03,105 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:39:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1451944619, now seen corresponding path program 1 times [2023-02-15 01:39:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:03,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902463974] [2023-02-15 01:39:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:03,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:03,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:03,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 01:39:03,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:03,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902463974] [2023-02-15 01:39:03,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902463974] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:39:03,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:39:03,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:39:03,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757144011] [2023-02-15 01:39:03,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:39:03,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:39:03,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:03,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:39:03,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:39:03,214 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:39:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:03,338 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2023-02-15 01:39:03,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:39:03,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2023-02-15 01:39:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:03,339 INFO L225 Difference]: With dead ends: 86 [2023-02-15 01:39:03,339 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 01:39:03,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:39:03,340 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 44 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:03,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 207 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:39:03,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 01:39:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2023-02-15 01:39:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 69 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2023-02-15 01:39:03,341 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 46 [2023-02-15 01:39:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:03,342 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2023-02-15 01:39:03,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:39:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2023-02-15 01:39:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:39:03,342 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:03,342 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:03,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 01:39:03,342 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:39:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1451944618, now seen corresponding path program 1 times [2023-02-15 01:39:03,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:03,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361650813] [2023-02-15 01:39:03,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:03,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:03,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:03,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:03,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:03,462 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-15 01:39:03,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:03,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361650813] [2023-02-15 01:39:03,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361650813] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:03,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608435281] [2023-02-15 01:39:03,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:03,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:03,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:03,464 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:39:03,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 01:39:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:03,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:39:03,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 01:39:03,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:39:03,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608435281] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:39:03,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:39:03,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-15 01:39:03,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131500600] [2023-02-15 01:39:03,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:39:03,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:39:03,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:03,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:39:03,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:39:03,659 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-15 01:39:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:03,671 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2023-02-15 01:39:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:39:03,671 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-15 01:39:03,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:03,672 INFO L225 Difference]: With dead ends: 73 [2023-02-15 01:39:03,672 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 01:39:03,672 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-15 01:39:03,673 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-15 01:39:03,673 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-15 01:39:03,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 01:39:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-15 01:39:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 68 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2023-02-15 01:39:03,675 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 46 [2023-02-15 01:39:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:03,675 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2023-02-15 01:39:03,675 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-15 01:39:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2023-02-15 01:39:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 01:39:03,676 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:03,676 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:03,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 01:39:03,882 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-15 01:39:03,882 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:39:03,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2059192403, now seen corresponding path program 1 times [2023-02-15 01:39:03,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:03,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593351426] [2023-02-15 01:39:03,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:03,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:04,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:04,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:04,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:04,054 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-15 01:39:04,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:04,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593351426] [2023-02-15 01:39:04,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593351426] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:04,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972912590] [2023-02-15 01:39:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:04,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:04,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:04,057 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:39:04,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 01:39:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:04,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 01:39:04,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 01:39:04,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:39:04,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972912590] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:39:04,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:39:04,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-02-15 01:39:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847150129] [2023-02-15 01:39:04,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:39:04,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:39:04,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:04,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:39:04,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:39:04,257 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-15 01:39:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:04,295 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2023-02-15 01:39:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:39:04,296 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-15 01:39:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:04,296 INFO L225 Difference]: With dead ends: 70 [2023-02-15 01:39:04,297 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 01:39:04,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:39:04,297 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-15 01:39:04,298 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-15 01:39:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 01:39:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-15 01:39:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2023-02-15 01:39:04,300 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 47 [2023-02-15 01:39:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:04,300 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2023-02-15 01:39:04,300 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-15 01:39:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2023-02-15 01:39:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 01:39:04,302 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:04,302 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:04,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 01:39:04,508 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-15 01:39:04,509 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:39:04,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash 589543324, now seen corresponding path program 1 times [2023-02-15 01:39:04,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:04,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185009541] [2023-02-15 01:39:04,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:04,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:04,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:04,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:04,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 01:39:04,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:04,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185009541] [2023-02-15 01:39:04,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185009541] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:39:04,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:39:04,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:39:04,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652554774] [2023-02-15 01:39:04,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:39:04,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:39:04,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:04,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:39:04,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:39:04,588 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:39:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:04,647 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2023-02-15 01:39:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:39:04,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2023-02-15 01:39:04,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:04,649 INFO L225 Difference]: With dead ends: 81 [2023-02-15 01:39:04,649 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 01:39:04,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:39:04,650 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-15 01:39:04,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 140 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:39:04,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 01:39:04,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2023-02-15 01:39:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 64 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2023-02-15 01:39:04,653 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 48 [2023-02-15 01:39:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:04,654 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2023-02-15 01:39:04,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:39:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2023-02-15 01:39:04,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 01:39:04,655 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:04,655 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:04,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 01:39:04,655 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:39:04,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:04,656 INFO L85 PathProgramCache]: Analyzing trace with hash 589543325, now seen corresponding path program 1 times [2023-02-15 01:39:04,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:04,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166753457] [2023-02-15 01:39:04,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:04,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:04,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:04,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:04,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:39:05,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:05,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166753457] [2023-02-15 01:39:05,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166753457] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:05,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550888572] [2023-02-15 01:39:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:05,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:05,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:05,099 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:39:05,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 01:39:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:05,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 01:39:05,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 01:39:05,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:39:05,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550888572] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:39:05,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:39:05,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [18] total 20 [2023-02-15 01:39:05,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988071379] [2023-02-15 01:39:05,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:39:05,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:39:05,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:05,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:39:05,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2023-02-15 01:39:05,305 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:39:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:05,347 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2023-02-15 01:39:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:39:05,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2023-02-15 01:39:05,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:05,348 INFO L225 Difference]: With dead ends: 68 [2023-02-15 01:39:05,348 INFO L226 Difference]: Without dead ends: 68 [2023-02-15 01:39:05,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2023-02-15 01:39:05,349 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 39 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:05,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 111 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:39:05,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-02-15 01:39:05,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-02-15 01:39:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2023-02-15 01:39:05,352 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 48 [2023-02-15 01:39:05,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:05,352 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2023-02-15 01:39:05,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:39:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2023-02-15 01:39:05,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 01:39:05,353 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:05,353 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:05,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 01:39:05,559 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-15 01:39:05,559 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:39:05,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1095973890, now seen corresponding path program 1 times [2023-02-15 01:39:05,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:05,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25157125] [2023-02-15 01:39:05,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:05,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:05,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:05,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 01:39:05,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:05,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25157125] [2023-02-15 01:39:05,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25157125] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:39:05,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:39:05,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:39:05,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30150300] [2023-02-15 01:39:05,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:39:05,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:39:05,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:05,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:39:05,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:39:05,737 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:39:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:05,814 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2023-02-15 01:39:05,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:39:05,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2023-02-15 01:39:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:05,815 INFO L225 Difference]: With dead ends: 67 [2023-02-15 01:39:05,815 INFO L226 Difference]: Without dead ends: 67 [2023-02-15 01:39:05,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:39:05,815 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:05,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 206 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:39:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-15 01:39:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-02-15 01:39:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 62 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2023-02-15 01:39:05,817 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 49 [2023-02-15 01:39:05,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:05,817 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2023-02-15 01:39:05,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:39:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2023-02-15 01:39:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 01:39:05,818 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:05,818 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:05,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 01:39:05,818 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:39:05,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:05,818 INFO L85 PathProgramCache]: Analyzing trace with hash 15214980, now seen corresponding path program 1 times [2023-02-15 01:39:05,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:05,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466946621] [2023-02-15 01:39:05,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:05,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:06,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:06,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:06,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:39:06,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:06,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466946621] [2023-02-15 01:39:06,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466946621] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:06,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465065267] [2023-02-15 01:39:06,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:06,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:06,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:06,567 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:39:06,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 01:39:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:06,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-15 01:39:06,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:06,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:39:06,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:39:06,831 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-15 01:39:06,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:06,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:39:06,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:39:06,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:39:06,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:06,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:39:07,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 01:39:07,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:39:07,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:39:07,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:07,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 01:39:07,391 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 01:39:07,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-15 01:39:07,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:07,402 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-15 01:39:07,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:07,571 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-15 01:39:07,688 INFO L321 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2023-02-15 01:39:07,689 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-15 01:39:07,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:07,886 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 01:39:07,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 90 [2023-02-15 01:39:07,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:39:08,114 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:39:08,115 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-15 01:39:08,203 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-15 01:39:08,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:12,539 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-15 01:39:14,583 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-15 01:39:14,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465065267] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:14,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:39:14,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2023-02-15 01:39:14,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982599000] [2023-02-15 01:39:14,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:14,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 01:39:14,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:14,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 01:39:14,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2257, Unknown=18, NotChecked=294, Total=2756 [2023-02-15 01:39:14,713 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-15 01:39:17,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:17,088 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2023-02-15 01:39:17,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 01:39:17,089 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-15 01:39:17,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:17,090 INFO L225 Difference]: With dead ends: 147 [2023-02-15 01:39:17,090 INFO L226 Difference]: Without dead ends: 147 [2023-02-15 01:39:17,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=679, Invalid=4427, Unknown=18, NotChecked=426, Total=5550 [2023-02-15 01:39:17,092 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1340 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:17,092 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.7s Time] [2023-02-15 01:39:17,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-15 01:39:17,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 68. [2023-02-15 01:39:17,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2023-02-15 01:39:17,094 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 54 [2023-02-15 01:39:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:17,094 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2023-02-15 01:39:17,095 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-15 01:39:17,095 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2023-02-15 01:39:17,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 01:39:17,095 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:17,095 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:17,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 01:39:17,295 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-15 01:39:17,296 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:39:17,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:17,296 INFO L85 PathProgramCache]: Analyzing trace with hash 15214981, now seen corresponding path program 1 times [2023-02-15 01:39:17,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:17,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451371582] [2023-02-15 01:39:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:17,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:17,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:17,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:18,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:39:18,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:18,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451371582] [2023-02-15 01:39:18,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451371582] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:18,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825220201] [2023-02-15 01:39:18,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:18,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:18,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:18,281 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:39:18,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 01:39:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:18,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-15 01:39:18,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:18,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 01:39:18,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:39:19,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:19,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:39:19,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:19,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:39:19,027 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:39:19,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-15 01:39:19,210 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:39:19,210 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-15 01:39:19,222 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 01:39:19,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:39:22,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:22,706 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 01:39:22,707 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-15 01:39:22,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:22,722 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 01:39:22,722 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-15 01:39:22,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:39:22,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:39:22,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:39:22,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 01:39:22,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:39:22,971 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-15 01:39:22,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:39:22,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825220201] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:39:22,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:39:22,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [23] total 39 [2023-02-15 01:39:22,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231820018] [2023-02-15 01:39:22,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:39:22,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 01:39:22,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:22,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 01:39:22,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1443, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 01:39:22,973 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-15 01:39:27,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 01:39:27,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:27,991 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-02-15 01:39:27,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 01:39:27,991 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-15 01:39:27,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:27,992 INFO L225 Difference]: With dead ends: 91 [2023-02-15 01:39:27,992 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 01:39:27,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=254, Invalid=2296, Unknown=0, NotChecked=0, Total=2550 [2023-02-15 01:39:27,993 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.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:27,993 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.3s Time] [2023-02-15 01:39:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 01:39:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2023-02-15 01:39:27,995 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-15 01:39:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2023-02-15 01:39:27,995 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 54 [2023-02-15 01:39:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:27,995 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2023-02-15 01:39:27,995 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-15 01:39:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2023-02-15 01:39:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 01:39:27,996 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:27,996 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:28,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-15 01:39:28,204 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-15 01:39:28,205 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-15 01:39:28,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:28,205 INFO L85 PathProgramCache]: Analyzing trace with hash 471663079, now seen corresponding path program 1 times [2023-02-15 01:39:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:28,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418357762] [2023-02-15 01:39:28,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:28,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:28,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:28,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:39:29,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:29,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418357762] [2023-02-15 01:39:29,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418357762] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:29,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786808794] [2023-02-15 01:39:29,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:29,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:29,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:29,091 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:39:29,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 01:39:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:29,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 01:39:29,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:29,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 01:39:29,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:29,688 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-15 01:39:29,787 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:39:29,787 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-15 01:39:31,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:31,860 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 01:39:31,860 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-15 01:39:31,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:39:31,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 01:39:31,888 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-15 01:39:31,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:39:31,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786808794] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:39:31,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:39:31,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [24] total 38 [2023-02-15 01:39:31,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632556706] [2023-02-15 01:39:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:39:31,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 01:39:31,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:31,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 01:39:31,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1305, Unknown=1, NotChecked=0, Total=1406 [2023-02-15 01:39:31,890 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-15 01:39:38,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 01:39:38,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:38,361 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2023-02-15 01:39:38,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 01:39:38,362 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-15 01:39:38,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:38,370 INFO L225 Difference]: With dead ends: 74 [2023-02-15 01:39:38,370 INFO L226 Difference]: Without dead ends: 74 [2023-02-15 01:39:38,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=205, Invalid=2050, Unknown=1, NotChecked=0, Total=2256 [2023-02-15 01:39:38,372 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 254 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 14 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:38,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 421 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 438 Invalid, 10 Unknown, 0 Unchecked, 2.2s Time] [2023-02-15 01:39:38,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-15 01:39:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2023-02-15 01:39:38,383 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-15 01:39:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2023-02-15 01:39:38,383 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 55 [2023-02-15 01:39:38,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:38,384 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2023-02-15 01:39:38,384 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-15 01:39:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2023-02-15 01:39:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 01:39:38,385 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:38,386 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:38,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 01:39:38,591 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-15 01:39:38,592 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:39:38,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:38,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1777907541, now seen corresponding path program 1 times [2023-02-15 01:39:38,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:38,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573221437] [2023-02-15 01:39:38,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:39,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:39,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:39,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:39:40,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:40,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573221437] [2023-02-15 01:39:40,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573221437] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:40,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786331695] [2023-02-15 01:39:40,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:40,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:40,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:40,115 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:39:40,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 01:39:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:40,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 112 conjunts are in the unsatisfiable core [2023-02-15 01:39:40,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:40,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:39:40,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:39:40,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2023-02-15 01:39:40,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-02-15 01:39:40,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:39:40,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:39:41,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:41,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 42 treesize of output 33 [2023-02-15 01:39:41,155 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:39:41,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:39:41,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 24 treesize of output 19 [2023-02-15 01:39:41,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:41,165 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-15 01:39:41,640 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:39:41,640 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-15 01:39:41,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2023-02-15 01:39:41,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:41,654 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-15 01:39:41,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:41,729 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-15 01:39:41,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 01:39:41,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:41,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-02-15 01:39:41,818 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-15 01:39:41,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-02-15 01:39:41,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:39:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:39:41,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:41,994 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-15 01:39:42,767 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (v_ArrVal_2430 Int) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 v_ArrVal_2430)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2437) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2432) |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 (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|) .cse0 v_ArrVal_2433)) |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-15 01:39:42,790 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (v_ArrVal_2430 Int) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 v_ArrVal_2430)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2437) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2432) |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 (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|) .cse0 v_ArrVal_2433)) |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-15 01:39:45,263 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2437 (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)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_2430)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2437) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2432) |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 (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_2433)) |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-15 01:39:49,801 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-15 01:39:49,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786331695] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:49,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:39:49,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2023-02-15 01:39:49,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029175994] [2023-02-15 01:39:49,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:49,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 01:39:49,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:49,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 01:39:49,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2150, Unknown=58, NotChecked=490, Total=2862 [2023-02-15 01:39:49,805 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-15 01:39:51,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:51,959 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2023-02-15 01:39:51,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 01:39:51,960 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-15 01:39:51,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:51,971 INFO L225 Difference]: With dead ends: 116 [2023-02-15 01:39:51,971 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 01:39:51,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=463, Invalid=4605, Unknown=64, NotChecked=720, Total=5852 [2023-02-15 01:39:51,976 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 388 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:51,977 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.8s Time] [2023-02-15 01:39:51,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 01:39:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 79. [2023-02-15 01:39:51,984 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-15 01:39:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2023-02-15 01:39:51,985 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 58 [2023-02-15 01:39:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:51,985 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2023-02-15 01:39:51,985 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-15 01:39:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2023-02-15 01:39:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 01:39:51,986 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:51,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:52,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 01:39:52,186 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-15 01:39:52,187 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:39:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1527316149, now seen corresponding path program 1 times [2023-02-15 01:39:52,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:52,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147353156] [2023-02-15 01:39:52,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:52,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:52,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:52,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:52,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:39:52,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:52,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147353156] [2023-02-15 01:39:52,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147353156] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:52,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139268907] [2023-02-15 01:39:52,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:52,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:52,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:52,579 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:39:52,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 01:39:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:52,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 01:39:52,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:52,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:39:52,838 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-15 01:39:52,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:39:52,871 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-15 01:39:52,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:39:52,904 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-15 01:39:52,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:39:52,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:39:52,954 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:39:52,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:39:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2023-02-15 01:39:52,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 01:39:53,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139268907] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:39:53,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:39:53,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 7] total 30 [2023-02-15 01:39:53,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873515213] [2023-02-15 01:39:53,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:53,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 01:39:53,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:53,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 01:39:53,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=623, Unknown=3, NotChecked=156, Total=870 [2023-02-15 01:39:53,374 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-15 01:39:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:53,978 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2023-02-15 01:39:53,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 01:39:53,978 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-15 01:39:53,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:53,979 INFO L225 Difference]: With dead ends: 70 [2023-02-15 01:39:53,979 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 01:39:53,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 101 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=334, Invalid=1567, Unknown=3, NotChecked=258, Total=2162 [2023-02-15 01:39:53,980 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.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:53,980 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.2s Time] [2023-02-15 01:39:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 01:39:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-15 01:39:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2023-02-15 01:39:53,982 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 58 [2023-02-15 01:39:53,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:53,982 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2023-02-15 01:39:53,982 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-15 01:39:53,982 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2023-02-15 01:39:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 01:39:53,982 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:53,983 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:53,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 01:39:54,189 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-15 01:39:54,189 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:39:54,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:54,189 INFO L85 PathProgramCache]: Analyzing trace with hash 719441558, now seen corresponding path program 1 times [2023-02-15 01:39:54,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:54,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389539216] [2023-02-15 01:39:54,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:54,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:55,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:55,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:55,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:39:55,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:55,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389539216] [2023-02-15 01:39:55,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389539216] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:55,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646918035] [2023-02-15 01:39:55,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:55,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:55,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:55,668 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:39:55,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 01:39:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:55,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 98 conjunts are in the unsatisfiable core [2023-02-15 01:39:55,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:56,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:39:56,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:39:56,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:39:56,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:56,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-02-15 01:39:56,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:56,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 01:39:56,776 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 01:39:56,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-15 01:39:57,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:57,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 44 [2023-02-15 01:39:57,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:57,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2023-02-15 01:39:57,250 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 01:39:57,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 100 [2023-02-15 01:39:57,258 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:39:57,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 90 [2023-02-15 01:39:57,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 58 [2023-02-15 01:39:57,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:57,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:57,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 31 [2023-02-15 01:39:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:39:57,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:57,735 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-15 01:39:57,742 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-15 01:39:57,786 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-15 01:39:57,793 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-15 01:39:57,808 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-15 01:39:57,825 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-15 01:39:57,902 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-15 01:39:57,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646918035] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:57,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:39:57,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2023-02-15 01:39:57,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069923114] [2023-02-15 01:39:57,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:57,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-02-15 01:39:57,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:57,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-02-15 01:39:57,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3029, Unknown=8, NotChecked=812, Total=4032 [2023-02-15 01:39:57,908 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-15 01:40:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:00,878 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2023-02-15 01:40:00,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 01:40:00,879 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-15 01:40:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:00,879 INFO L225 Difference]: With dead ends: 105 [2023-02-15 01:40:00,879 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 01:40:00,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=655, Invalid=5525, Unknown=10, NotChecked=1120, Total=7310 [2023-02-15 01:40:00,881 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 959 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:00,881 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.0s Time] [2023-02-15 01:40:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 01:40:00,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2023-02-15 01:40:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:40:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2023-02-15 01:40:00,884 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 59 [2023-02-15 01:40:00,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:00,884 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2023-02-15 01:40:00,884 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-15 01:40:00,884 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2023-02-15 01:40:00,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 01:40:00,885 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:00,885 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:40:00,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 01:40:01,091 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-15 01:40:01,091 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:40:01,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:01,092 INFO L85 PathProgramCache]: Analyzing trace with hash 719441559, now seen corresponding path program 1 times [2023-02-15 01:40:01,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:01,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450746392] [2023-02-15 01:40:01,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:01,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:02,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:40:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:40:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:02,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:40:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:40:02,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:02,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450746392] [2023-02-15 01:40:02,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450746392] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:02,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370320641] [2023-02-15 01:40:02,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:02,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:02,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:40:02,712 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:40:02,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 01:40:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:02,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 113 conjunts are in the unsatisfiable core [2023-02-15 01:40:02,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:40:03,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:40:03,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:40:03,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:40:03,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:03,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-02-15 01:40:03,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:03,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 01:40:03,787 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:40:03,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:40:04,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:04,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2023-02-15 01:40:04,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:04,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2023-02-15 01:40:04,355 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 01:40:04,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 108 [2023-02-15 01:40:04,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:04,371 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 01:40:04,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 108 [2023-02-15 01:40:04,603 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:40:04,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:04,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:04,606 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-15 01:40:04,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:04,611 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 01:40:04,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 24 [2023-02-15 01:40:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:40:04,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:40:05,169 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-15 01:40:05,185 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-15 01:40:05,242 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-15 01:40:05,259 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_insert_#t~mem8#1.offset| 4))) (let ((.cse2 (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|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#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|)) (+ 4 .cse0)) 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 (+ 4 .cse4))) (<= (+ 8 (select (select .cse5 .cse6) .cse7)) (select |c_#length| (select (select .cse8 .cse6) .cse7))))))))))))) is different from false [2023-02-15 01:40:05,274 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-15 01:40:05,304 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 ((.cse2 (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| .cse9 (store (select |c_#memory_$Pointer$.offset| .cse9) .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)))) (and (forall ((v_ArrVal_3025 (Array Int Int))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_sll_insert_#t~ret7#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_#t~ret7#1.base| v_ArrVal_3024) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse0)) 4))))))) (forall ((v_ArrVal_3025 (Array Int Int))) (let ((.cse5 (store .cse3 |c_ULTIMATE.start_sll_insert_#t~ret7#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_#t~ret7#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-15 01:40:05,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:05,382 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-15 01:40:12,099 WARN L233 SmtUtils]: Spent 6.18s 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-15 01:40:12,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370320641] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:12,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:40:12,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 27] total 59 [2023-02-15 01:40:12,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857264373] [2023-02-15 01:40:12,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:40:12,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-02-15 01:40:12,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:12,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-02-15 01:40:12,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=4340, Unknown=6, NotChecked=822, Total=5402 [2023-02-15 01:40:12,104 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-15 01:40:22,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:22,184 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2023-02-15 01:40:22,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 01:40:22,185 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-15 01:40:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:22,186 INFO L225 Difference]: With dead ends: 120 [2023-02-15 01:40:22,186 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 01:40:22,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2030 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=727, Invalid=8411, Unknown=6, NotChecked=1158, Total=10302 [2023-02-15 01:40:22,188 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1233 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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, 3.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:22,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 810 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-02-15 01:40:22,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 01:40:22,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 74. [2023-02-15 01:40:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:40:22,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-02-15 01:40:22,190 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 59 [2023-02-15 01:40:22,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:22,190 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-02-15 01:40:22,190 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-15 01:40:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-02-15 01:40:22,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 01:40:22,191 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:22,191 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:40:22,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 01:40:22,391 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-15 01:40:22,391 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:40:22,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash 827850517, now seen corresponding path program 1 times [2023-02-15 01:40:22,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:22,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348335487] [2023-02-15 01:40:22,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:22,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:24,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:40:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:24,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:40:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:24,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:40:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:25,036 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:40:25,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:25,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348335487] [2023-02-15 01:40:25,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348335487] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:25,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576574997] [2023-02-15 01:40:25,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:25,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:25,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:40:25,040 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:40:25,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 01:40:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:25,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 96 conjunts are in the unsatisfiable core [2023-02-15 01:40:25,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:40:25,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:40:26,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:40:26,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:40:26,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 5 treesize of output 3 [2023-02-15 01:40:26,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:26,925 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-15 01:40:26,944 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:40:26,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:40:26,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:26,954 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-15 01:40:27,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:27,888 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-15 01:40:27,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:27,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2023-02-15 01:40:28,106 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 01:40:28,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 92 [2023-02-15 01:40:28,147 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:40:28,148 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-15 01:40:28,342 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-15 01:40:28,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:28,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:28,709 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-15 01:40:28,805 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-15 01:40:28,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:40:29,132 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-15 01:40:30,197 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3228 (Array Int Int)) (v_ArrVal_3229 (Array Int Int)) (v_ArrVal_3219 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_34| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_34|) 0)) (= 0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_34|) (not (= (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_34| v_ArrVal_3228))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_34| v_ArrVal_3229)) (.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) (+ (select (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_34|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_34| 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 (store .cse3 .cse2 v_ArrVal_3219) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_34| 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-15 01:40:30,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576574997] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:30,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:40:30,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 47 [2023-02-15 01:40:30,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104168264] [2023-02-15 01:40:30,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:40:30,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 01:40:30,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:30,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 01:40:30,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2787, Unknown=21, NotChecked=214, Total=3192 [2023-02-15 01:40:30,203 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-15 01:40:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:35,394 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2023-02-15 01:40:35,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 01:40:35,395 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-15 01:40:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:35,395 INFO L225 Difference]: With dead ends: 89 [2023-02-15 01:40:35,395 INFO L226 Difference]: Without dead ends: 89 [2023-02-15 01:40:35,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=517, Invalid=5322, Unknown=21, NotChecked=302, Total=6162 [2023-02-15 01:40:35,396 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 604 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:35,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 687 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-15 01:40:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-15 01:40:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 74. [2023-02-15 01:40:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 69 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:40:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2023-02-15 01:40:35,398 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 60 [2023-02-15 01:40:35,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:35,398 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2023-02-15 01:40:35,398 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-15 01:40:35,398 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2023-02-15 01:40:35,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 01:40:35,399 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:35,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:40:35,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 01:40:35,599 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-15 01:40:35,600 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:40:35,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:35,600 INFO L85 PathProgramCache]: Analyzing trace with hash 832836797, now seen corresponding path program 1 times [2023-02-15 01:40:35,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:35,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731742644] [2023-02-15 01:40:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:37,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:40:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:37,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:40:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:38,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:40:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:40:38,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:38,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731742644] [2023-02-15 01:40:38,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731742644] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:38,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752115136] [2023-02-15 01:40:38,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:38,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:38,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:40:38,816 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:40:38,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 01:40:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:39,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 133 conjunts are in the unsatisfiable core [2023-02-15 01:40:39,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:40:39,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:40:40,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:40:40,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:40:40,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:40:40,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:40:40,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:40,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-02-15 01:40:40,820 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:40:40,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:40:40,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:40,855 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-15 01:40:42,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:42,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 56 [2023-02-15 01:40:42,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:40:42,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:42,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2023-02-15 01:40:42,295 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 01:40:42,295 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-15 01:40:42,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:42,342 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 01:40:42,343 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-15 01:40:42,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:42,391 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-15 01:40:42,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:40:43,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:43,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:43,005 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-15 01:40:43,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:43,022 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 01:40:43,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 24 [2023-02-15 01:40:43,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:40:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:40:43,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:40:47,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:47,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 319 treesize of output 312 [2023-02-15 01:40:47,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:47,214 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-15 01:40:47,232 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-15 01:40:48,555 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-15 01:40:49,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:49,764 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