./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_prepend_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 e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:23:58,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:23:58,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:23:58,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:23:58,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:23:58,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:23:58,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:23:58,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:23:58,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:23:58,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:23:58,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:23:58,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:23:58,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:23:58,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:23:58,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:23:58,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:23:58,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:23:58,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:23:58,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:23:58,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:23:58,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:23:58,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:23:58,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:23:58,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:23:58,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:23:58,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:23:58,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:23:58,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:23:58,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:23:58,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:23:58,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:23:58,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:23:58,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:23:58,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:23:58,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:23:58,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:23:58,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:23:58,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:23:58,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:23:58,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:23:58,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:23:58,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:23:58,566 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:23:58,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:23:58,566 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:23:58,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:23:58,567 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:23:58,567 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:23:58,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:23:58,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:23:58,568 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:23:58,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:23:58,569 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:23:58,569 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:23:58,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:23:58,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:23:58,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:23:58,570 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:23:58,570 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:23:58,570 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:23:58,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:23:58,570 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:23:58,571 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:23:58,571 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:23:58,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:23:58,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:23:58,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:23:58,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:23:58,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:23:58,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:23:58,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:23:58,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:23:58,572 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:23:58,572 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:23:58,573 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:23:58,573 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:23:58,573 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 -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2023-02-15 22:23:58,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:23:58,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:23:58,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:23:58,769 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:23:58,769 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:23:58,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2023-02-15 22:23:59,771 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:24:00,022 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:24:00,025 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2023-02-15 22:24:00,033 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8fe79fc/cd4a09bbbf734283b49b41a563c3a0f4/FLAG5b2c45703 [2023-02-15 22:24:00,043 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8fe79fc/cd4a09bbbf734283b49b41a563c3a0f4 [2023-02-15 22:24:00,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:24:00,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:24:00,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:24:00,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:24:00,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:24:00,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:24:00" (1/1) ... [2023-02-15 22:24:00,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d8b179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:24:00, skipping insertion in model container [2023-02-15 22:24:00,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:24:00" (1/1) ... [2023-02-15 22:24:00,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:24:00,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:24:00,321 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/dll2c_prepend_equal.i[24640,24653] [2023-02-15 22:24:00,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:24:00,333 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:24:00,368 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/dll2c_prepend_equal.i[24640,24653] [2023-02-15 22:24:00,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:24:00,388 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:24:00,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:24:00 WrapperNode [2023-02-15 22:24:00,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:24:00,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:24:00,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:24:00,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:24:00,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:24:00" (1/1) ... [2023-02-15 22:24:00,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:24:00" (1/1) ... [2023-02-15 22:24:00,420 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2023-02-15 22:24:00,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:24:00,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:24:00,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:24:00,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:24:00,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:24:00" (1/1) ... [2023-02-15 22:24:00,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:24:00" (1/1) ... [2023-02-15 22:24:00,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:24:00" (1/1) ... [2023-02-15 22:24:00,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:24:00" (1/1) ... [2023-02-15 22:24:00,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:24:00" (1/1) ... [2023-02-15 22:24:00,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:24:00" (1/1) ... [2023-02-15 22:24:00,441 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:24:00" (1/1) ... [2023-02-15 22:24:00,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:24:00" (1/1) ... [2023-02-15 22:24:00,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:24:00,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:24:00,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:24:00,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:24:00,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:24:00" (1/1) ... [2023-02-15 22:24:00,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:24:00,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:00,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 22:24:00,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 22:24:00,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:24:00,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:24:00,505 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 22:24:00,505 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 22:24:00,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:24:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:24:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 22:24:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:24:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:24:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:24:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 22:24:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:24:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:24:00,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:24:00,586 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:24:00,590 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:24:00,876 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:24:00,883 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:24:00,885 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 22:24:00,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:24:00 BoogieIcfgContainer [2023-02-15 22:24:00,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:24:00,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:24:00,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:24:00,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:24:00,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:24:00" (1/3) ... [2023-02-15 22:24:00,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74656363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:24:00, skipping insertion in model container [2023-02-15 22:24:00,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:24:00" (2/3) ... [2023-02-15 22:24:00,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74656363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:24:00, skipping insertion in model container [2023-02-15 22:24:00,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:24:00" (3/3) ... [2023-02-15 22:24:00,895 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2023-02-15 22:24:00,909 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:24:00,910 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-02-15 22:24:00,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:24:00,993 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;@19a14863, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:24:00,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2023-02-15 22:24:00,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 125 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:24:01,001 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:01,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:24:01,002 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:01,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:01,006 INFO L85 PathProgramCache]: Analyzing trace with hash 895303154, now seen corresponding path program 1 times [2023-02-15 22:24:01,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:01,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194242072] [2023-02-15 22:24:01,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:01,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:24:01,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:01,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194242072] [2023-02-15 22:24:01,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194242072] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:01,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:01,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:24:01,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356657846] [2023-02-15 22:24:01,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:01,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:24:01,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:01,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:24:01,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:24:01,272 INFO L87 Difference]: Start difference. First operand has 130 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 125 states have internal predecessors, (137), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:24:01,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:01,414 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2023-02-15 22:24:01,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:24:01,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2023-02-15 22:24:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:01,423 INFO L225 Difference]: With dead ends: 127 [2023-02-15 22:24:01,423 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 22:24:01,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:24:01,427 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:01,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 193 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:24:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 22:24:01,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-02-15 22:24:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 63 states have (on average 2.0) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2023-02-15 22:24:01,467 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 6 [2023-02-15 22:24:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:01,468 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2023-02-15 22:24:01,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:24:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2023-02-15 22:24:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:24:01,469 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:01,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:24:01,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:24:01,470 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:01,471 INFO L85 PathProgramCache]: Analyzing trace with hash 895303155, now seen corresponding path program 1 times [2023-02-15 22:24:01,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:01,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050703872] [2023-02-15 22:24:01,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:01,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:24:01,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:01,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050703872] [2023-02-15 22:24:01,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050703872] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:01,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:01,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:24:01,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610560797] [2023-02-15 22:24:01,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:01,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:24:01,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:01,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:24:01,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:24:01,582 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:24:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:01,669 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2023-02-15 22:24:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:24:01,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2023-02-15 22:24:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:01,672 INFO L225 Difference]: With dead ends: 121 [2023-02-15 22:24:01,673 INFO L226 Difference]: Without dead ends: 121 [2023-02-15 22:24:01,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:24:01,675 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 5 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:01,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 195 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:24:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-15 22:24:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-02-15 22:24:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 116 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:01,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2023-02-15 22:24:01,685 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 6 [2023-02-15 22:24:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:01,685 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2023-02-15 22:24:01,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:24:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2023-02-15 22:24:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 22:24:01,686 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:01,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:01,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:24:01,686 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:01,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:01,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1495162356, now seen corresponding path program 1 times [2023-02-15 22:24:01,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:01,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518348476] [2023-02-15 22:24:01,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:01,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:01,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:01,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:24:01,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:01,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518348476] [2023-02-15 22:24:01,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518348476] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:01,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:01,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:24:01,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793931236] [2023-02-15 22:24:01,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:01,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:24:01,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:01,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:24:01,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:24:01,763 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:24:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:01,845 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2023-02-15 22:24:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:24:01,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2023-02-15 22:24:01,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:01,846 INFO L225 Difference]: With dead ends: 132 [2023-02-15 22:24:01,846 INFO L226 Difference]: Without dead ends: 132 [2023-02-15 22:24:01,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:24:01,847 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:01,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 292 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:24:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-15 22:24:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2023-02-15 22:24:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.9375) internal successors, (124), 117 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2023-02-15 22:24:01,854 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 14 [2023-02-15 22:24:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:01,854 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2023-02-15 22:24:01,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:24:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2023-02-15 22:24:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 22:24:01,855 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:01,855 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:01,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:24:01,855 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:01,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2091192736, now seen corresponding path program 1 times [2023-02-15 22:24:01,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:01,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293798298] [2023-02-15 22:24:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:01,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:01,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:24:02,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:02,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293798298] [2023-02-15 22:24:02,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293798298] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:02,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:02,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:24:02,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828676577] [2023-02-15 22:24:02,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:02,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:24:02,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:02,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:24:02,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:24:02,023 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:24:02,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:02,220 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2023-02-15 22:24:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:24:02,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2023-02-15 22:24:02,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:02,224 INFO L225 Difference]: With dead ends: 122 [2023-02-15 22:24:02,224 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 22:24:02,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:24:02,233 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 21 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:02,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 394 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:24:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 22:24:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2023-02-15 22:24:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 64 states have (on average 1.921875) internal successors, (123), 116 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2023-02-15 22:24:02,246 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 24 [2023-02-15 22:24:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:02,246 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2023-02-15 22:24:02,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:24:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2023-02-15 22:24:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 22:24:02,247 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:02,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:02,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:24:02,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:02,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:02,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2091192737, now seen corresponding path program 1 times [2023-02-15 22:24:02,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:02,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121926381] [2023-02-15 22:24:02,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:02,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:02,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:02,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:24:02,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:02,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121926381] [2023-02-15 22:24:02,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121926381] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:02,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:02,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:24:02,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218943915] [2023-02-15 22:24:02,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:02,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:24:02,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:02,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:24:02,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:24:02,435 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:24:02,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:02,623 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2023-02-15 22:24:02,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:24:02,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2023-02-15 22:24:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:02,624 INFO L225 Difference]: With dead ends: 121 [2023-02-15 22:24:02,624 INFO L226 Difference]: Without dead ends: 121 [2023-02-15 22:24:02,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:24:02,625 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 19 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:02,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 418 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:24:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-15 22:24:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2023-02-15 22:24:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 64 states have (on average 1.90625) internal successors, (122), 115 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2023-02-15 22:24:02,629 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 24 [2023-02-15 22:24:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:02,630 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2023-02-15 22:24:02,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:24:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2023-02-15 22:24:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:24:02,631 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:02,631 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:02,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:24:02,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:02,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:02,632 INFO L85 PathProgramCache]: Analyzing trace with hash -408475519, now seen corresponding path program 1 times [2023-02-15 22:24:02,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:02,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818793617] [2023-02-15 22:24:02,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:02,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:02,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:02,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:24:02,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:02,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818793617] [2023-02-15 22:24:02,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818793617] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:02,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109785031] [2023-02-15 22:24:02,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:02,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:02,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:02,818 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:24:02,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 22:24:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:02,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:24:02,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:02,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:24:02,984 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:24:03,041 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:24:03,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:24:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-15 22:24:03,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:03,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109785031] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:03,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:24:03,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-02-15 22:24:03,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969624356] [2023-02-15 22:24:03,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:03,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:24:03,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:03,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:24:03,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-02-15 22:24:03,126 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:24:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:03,388 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2023-02-15 22:24:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:24:03,389 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-02-15 22:24:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:03,390 INFO L225 Difference]: With dead ends: 145 [2023-02-15 22:24:03,390 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 22:24:03,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-02-15 22:24:03,390 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 98 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:03,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 352 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 451 Invalid, 0 Unknown, 149 Unchecked, 0.2s Time] [2023-02-15 22:24:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 22:24:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2023-02-15 22:24:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 119 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:24:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2023-02-15 22:24:03,395 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 26 [2023-02-15 22:24:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:03,395 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2023-02-15 22:24:03,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:24:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2023-02-15 22:24:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:24:03,396 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:03,396 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:03,413 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 22:24:03,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 22:24:03,609 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:03,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:03,610 INFO L85 PathProgramCache]: Analyzing trace with hash -408475518, now seen corresponding path program 1 times [2023-02-15 22:24:03,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:03,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812016368] [2023-02-15 22:24:03,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:03,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:03,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:03,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:24:03,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:03,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812016368] [2023-02-15 22:24:03,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812016368] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:03,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521379402] [2023-02-15 22:24:03,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:03,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:03,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:03,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:24:03,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 22:24:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:04,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 22:24:04,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:04,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:24:04,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:24:04,263 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_494 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_494))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:24:04,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:04,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:24:04,316 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:24:04,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:24:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-15 22:24:04,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:06,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521379402] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:06,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:24:06,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2023-02-15 22:24:06,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410207032] [2023-02-15 22:24:06,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:06,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:24:06,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:06,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:24:06,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2023-02-15 22:24:06,451 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:24:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:06,858 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-02-15 22:24:06,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:24:06,860 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-02-15 22:24:06,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:06,861 INFO L225 Difference]: With dead ends: 127 [2023-02-15 22:24:06,861 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 22:24:06,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=73, Invalid=350, Unknown=1, NotChecked=38, Total=462 [2023-02-15 22:24:06,862 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 7 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:06,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 548 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 719 Invalid, 0 Unknown, 123 Unchecked, 0.3s Time] [2023-02-15 22:24:06,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 22:24:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2023-02-15 22:24:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8676470588235294) internal successors, (127), 119 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:24:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2023-02-15 22:24:06,865 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 26 [2023-02-15 22:24:06,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:06,865 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2023-02-15 22:24:06,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:24:06,865 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2023-02-15 22:24:06,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 22:24:06,866 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:06,866 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:06,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:24:07,066 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,SelfDestructingSolverStorable6 [2023-02-15 22:24:07,067 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:07,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:07,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1702795689, now seen corresponding path program 1 times [2023-02-15 22:24:07,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:07,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784918254] [2023-02-15 22:24:07,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:07,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:24:07,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:07,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784918254] [2023-02-15 22:24:07,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784918254] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:07,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726571301] [2023-02-15 22:24:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:07,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:07,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:07,185 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:24:07,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 22:24:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:24:07,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:24:07,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:24:07,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726571301] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:24:07,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:24:07,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-02-15 22:24:07,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701005394] [2023-02-15 22:24:07,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:07,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:24:07,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:07,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:24:07,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:24:07,405 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:24:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:07,533 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2023-02-15 22:24:07,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:24:07,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-02-15 22:24:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:07,534 INFO L225 Difference]: With dead ends: 126 [2023-02-15 22:24:07,534 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 22:24:07,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:24:07,535 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 4 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:07,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 612 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:24:07,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 22:24:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2023-02-15 22:24:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 119 states have internal predecessors, (126), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:24:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2023-02-15 22:24:07,539 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 28 [2023-02-15 22:24:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:07,540 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2023-02-15 22:24:07,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:24:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2023-02-15 22:24:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 22:24:07,540 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:07,541 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:07,561 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 22:24:07,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:07,746 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:07,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1251839470, now seen corresponding path program 1 times [2023-02-15 22:24:07,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:07,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884975127] [2023-02-15 22:24:07,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:07,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:24:07,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:07,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884975127] [2023-02-15 22:24:07,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884975127] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:07,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977769248] [2023-02-15 22:24:07,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:07,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:07,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:07,835 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:24:07,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 22:24:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 22:24:07,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:24:07,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:07,977 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:24:07,977 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 12 treesize of output 11 [2023-02-15 22:24:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:24:07,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977769248] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:24:07,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:24:07,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-02-15 22:24:07,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256373995] [2023-02-15 22:24:07,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:07,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:24:07,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:07,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:24:07,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:24:07,995 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:24:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:08,140 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2023-02-15 22:24:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:24:08,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-02-15 22:24:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:08,141 INFO L225 Difference]: With dead ends: 130 [2023-02-15 22:24:08,141 INFO L226 Difference]: Without dead ends: 130 [2023-02-15 22:24:08,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:24:08,142 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 11 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:08,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 398 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:24:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-15 22:24:08,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2023-02-15 22:24:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 122 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:24:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2023-02-15 22:24:08,145 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 29 [2023-02-15 22:24:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:08,145 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2023-02-15 22:24:08,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:24:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2023-02-15 22:24:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 22:24:08,145 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:08,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:08,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 22:24:08,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:08,351 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:08,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1251839469, now seen corresponding path program 1 times [2023-02-15 22:24:08,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:08,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33896953] [2023-02-15 22:24:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:08,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:24:08,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:08,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33896953] [2023-02-15 22:24:08,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33896953] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:08,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589786464] [2023-02-15 22:24:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:08,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:08,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:08,513 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:24:08,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 22:24:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:08,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 22:24:08,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:24:08,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:08,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:24:08,715 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 20 treesize of output 24 [2023-02-15 22:24:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:24:08,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589786464] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:24:08,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:24:08,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2023-02-15 22:24:08,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197872417] [2023-02-15 22:24:08,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:08,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 22:24:08,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:08,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 22:24:08,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:24:08,803 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 22:24:08,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:08,991 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2023-02-15 22:24:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:24:08,992 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-02-15 22:24:08,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:08,993 INFO L225 Difference]: With dead ends: 135 [2023-02-15 22:24:08,993 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 22:24:08,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:24:08,993 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 27 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:08,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 971 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:24:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 22:24:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2023-02-15 22:24:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 122 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:24:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2023-02-15 22:24:08,996 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 29 [2023-02-15 22:24:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:08,996 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2023-02-15 22:24:08,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 22:24:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2023-02-15 22:24:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 22:24:08,997 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:08,997 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:09,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:24:09,197 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,SelfDestructingSolverStorable9 [2023-02-15 22:24:09,198 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash -152317901, now seen corresponding path program 1 times [2023-02-15 22:24:09,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:09,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417988754] [2023-02-15 22:24:09,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:09,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:09,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:09,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:24:09,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:09,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417988754] [2023-02-15 22:24:09,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417988754] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:09,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:09,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:24:09,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262159618] [2023-02-15 22:24:09,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:09,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:24:09,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:09,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:24:09,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:24:09,319 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:24:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:09,515 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2023-02-15 22:24:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:24:09,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 30 [2023-02-15 22:24:09,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:09,516 INFO L225 Difference]: With dead ends: 128 [2023-02-15 22:24:09,516 INFO L226 Difference]: Without dead ends: 128 [2023-02-15 22:24:09,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:24:09,516 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 24 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:09,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 438 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:24:09,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-15 22:24:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2023-02-15 22:24:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8169014084507042) internal successors, (129), 121 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:24:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2023-02-15 22:24:09,519 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 30 [2023-02-15 22:24:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:09,519 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2023-02-15 22:24:09,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:24:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2023-02-15 22:24:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 22:24:09,519 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:09,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:09,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 22:24:09,519 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:09,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:09,520 INFO L85 PathProgramCache]: Analyzing trace with hash -152317900, now seen corresponding path program 1 times [2023-02-15 22:24:09,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:09,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421031244] [2023-02-15 22:24:09,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:09,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:09,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:09,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:24:09,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:09,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421031244] [2023-02-15 22:24:09,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421031244] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:09,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:09,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:24:09,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055114013] [2023-02-15 22:24:09,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:09,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:24:09,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:09,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:24:09,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:24:09,685 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:24:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:09,908 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2023-02-15 22:24:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:24:09,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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 30 [2023-02-15 22:24:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:09,909 INFO L225 Difference]: With dead ends: 126 [2023-02-15 22:24:09,909 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 22:24:09,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:24:09,910 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 20 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:09,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 468 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:24:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 22:24:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-02-15 22:24:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 71 states have (on average 1.8028169014084507) internal successors, (128), 120 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:24:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2023-02-15 22:24:09,912 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 30 [2023-02-15 22:24:09,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:09,912 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2023-02-15 22:24:09,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:24:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2023-02-15 22:24:09,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:24:09,913 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:09,913 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:09,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 22:24:09,913 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1115824007, now seen corresponding path program 1 times [2023-02-15 22:24:09,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:09,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788192354] [2023-02-15 22:24:09,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:09,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-15 22:24:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 22:24:10,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:10,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788192354] [2023-02-15 22:24:10,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788192354] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:10,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121734279] [2023-02-15 22:24:10,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:10,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:10,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:10,028 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:24:10,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 22:24:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:24:10,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:24:10,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:24:10,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121734279] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:10,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:24:10,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-15 22:24:10,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930751645] [2023-02-15 22:24:10,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:10,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:24:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:10,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:24:10,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:24:10,207 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:24:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:10,215 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2023-02-15 22:24:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:24:10,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2023-02-15 22:24:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:10,216 INFO L225 Difference]: With dead ends: 114 [2023-02-15 22:24:10,216 INFO L226 Difference]: Without dead ends: 114 [2023-02-15 22:24:10,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:24:10,216 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 98 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:10,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 144 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:24:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-15 22:24:10,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-02-15 22:24:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 64 states have (on average 1.78125) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2023-02-15 22:24:10,219 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 41 [2023-02-15 22:24:10,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:10,219 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2023-02-15 22:24:10,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:24:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2023-02-15 22:24:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:24:10,219 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:10,219 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:10,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 22:24:10,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:10,424 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:10,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:10,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1638195673, now seen corresponding path program 1 times [2023-02-15 22:24:10,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:10,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113313706] [2023-02-15 22:24:10,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:10,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 22:24:10,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:10,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113313706] [2023-02-15 22:24:10,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113313706] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:10,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513363741] [2023-02-15 22:24:10,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:10,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:10,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:10,778 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:24:10,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 22:24:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 22:24:10,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:10,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:24:10,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:24:10,991 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1583 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1583))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-15 22:24:11,006 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1583 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1583)))) is different from true [2023-02-15 22:24:11,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:11,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:24:11,051 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-15 22:24:11,068 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:24:11,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:24:11,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:11,177 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-02-15 22:24:11,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 22 [2023-02-15 22:24:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2023-02-15 22:24:11,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:11,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513363741] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:11,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:24:11,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2023-02-15 22:24:11,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547528263] [2023-02-15 22:24:11,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:11,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:24:11,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:11,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:24:11,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=249, Unknown=3, NotChecked=102, Total=420 [2023-02-15 22:24:11,340 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:24:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:11,640 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2023-02-15 22:24:11,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:24:11,641 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2023-02-15 22:24:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:11,641 INFO L225 Difference]: With dead ends: 124 [2023-02-15 22:24:11,642 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 22:24:11,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=445, Unknown=3, NotChecked=138, Total=702 [2023-02-15 22:24:11,642 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 422 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:11,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 297 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 434 Invalid, 0 Unknown, 322 Unchecked, 0.2s Time] [2023-02-15 22:24:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 22:24:11,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2023-02-15 22:24:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.65625) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2023-02-15 22:24:11,644 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 43 [2023-02-15 22:24:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:11,644 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2023-02-15 22:24:11,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:24:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2023-02-15 22:24:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:24:11,645 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:11,645 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:11,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:24:11,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:11,851 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:11,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:11,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1638195672, now seen corresponding path program 1 times [2023-02-15 22:24:11,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:11,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495837303] [2023-02-15 22:24:11,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:11,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:12,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:12,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:12,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:24:12,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:12,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495837303] [2023-02-15 22:24:12,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495837303] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:12,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347043724] [2023-02-15 22:24:12,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:12,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:12,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:12,420 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:24:12,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 22:24:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:12,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 22:24:12,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:12,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:24:12,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:24:12,620 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1821 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1821))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:24:12,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:12,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:24:12,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:24:12,664 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1822 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1822))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:24:12,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:12,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:24:12,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:24:12,746 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1823 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1823))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:24:12,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:12,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:24:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2023-02-15 22:24:12,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:14,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347043724] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:14,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:24:14,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2023-02-15 22:24:14,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674897356] [2023-02-15 22:24:14,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:14,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 22:24:14,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:14,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 22:24:14,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=287, Unknown=3, NotChecked=108, Total=462 [2023-02-15 22:24:14,891 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand has 20 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:24:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:15,267 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2023-02-15 22:24:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:24:15,268 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2023-02-15 22:24:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:15,268 INFO L225 Difference]: With dead ends: 116 [2023-02-15 22:24:15,268 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 22:24:15,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=110, Invalid=451, Unknown=3, NotChecked=138, Total=702 [2023-02-15 22:24:15,269 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 490 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 348 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:15,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 213 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 412 Invalid, 0 Unknown, 348 Unchecked, 0.3s Time] [2023-02-15 22:24:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 22:24:15,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2023-02-15 22:24:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.53125) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2023-02-15 22:24:15,271 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 43 [2023-02-15 22:24:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:15,271 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2023-02-15 22:24:15,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:24:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2023-02-15 22:24:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:24:15,272 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:15,272 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:15,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 22:24:15,479 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,SelfDestructingSolverStorable14 [2023-02-15 22:24:15,480 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:15,480 INFO L85 PathProgramCache]: Analyzing trace with hash 226108014, now seen corresponding path program 1 times [2023-02-15 22:24:15,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:15,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813223382] [2023-02-15 22:24:15,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:15,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:15,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:15,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:15,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 22:24:15,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:15,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813223382] [2023-02-15 22:24:15,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813223382] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:15,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:15,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:24:15,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555953987] [2023-02-15 22:24:15,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:15,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:24:15,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:15,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:24:15,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:24:15,607 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:24:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:15,750 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2023-02-15 22:24:15,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:24:15,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2023-02-15 22:24:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:15,751 INFO L225 Difference]: With dead ends: 112 [2023-02-15 22:24:15,751 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 22:24:15,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:24:15,752 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:15,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 259 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:24:15,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 22:24:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2023-02-15 22:24:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.46875) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2023-02-15 22:24:15,754 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 46 [2023-02-15 22:24:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:15,754 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2023-02-15 22:24:15,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:24:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2023-02-15 22:24:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:24:15,755 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:15,755 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:15,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 22:24:15,755 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:15,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:15,755 INFO L85 PathProgramCache]: Analyzing trace with hash 226108015, now seen corresponding path program 1 times [2023-02-15 22:24:15,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:15,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097486803] [2023-02-15 22:24:15,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:15,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:15,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:15,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:15,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 22:24:15,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:15,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097486803] [2023-02-15 22:24:15,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097486803] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:15,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:15,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:24:15,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218213856] [2023-02-15 22:24:15,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:15,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:24:15,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:15,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:24:15,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:24:15,932 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:24:16,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:16,060 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2023-02-15 22:24:16,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:24:16,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2023-02-15 22:24:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:16,061 INFO L225 Difference]: With dead ends: 90 [2023-02-15 22:24:16,061 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 22:24:16,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:24:16,061 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 67 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:16,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 270 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:24:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 22:24:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-02-15 22:24:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.40625) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-02-15 22:24:16,063 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 46 [2023-02-15 22:24:16,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:16,063 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-02-15 22:24:16,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:24:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-02-15 22:24:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:24:16,064 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:16,064 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:16,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 22:24:16,064 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:16,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:16,064 INFO L85 PathProgramCache]: Analyzing trace with hash 226118937, now seen corresponding path program 1 times [2023-02-15 22:24:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:16,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107166797] [2023-02-15 22:24:16,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:16,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:16,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:16,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:16,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:24:16,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:16,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107166797] [2023-02-15 22:24:16,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107166797] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:16,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314528096] [2023-02-15 22:24:16,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:16,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:16,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:16,580 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:24:16,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 22:24:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:16,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 22:24:16,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:16,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:24:16,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 22:24:17,089 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2367 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2367))))) is different from true [2023-02-15 22:24:17,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:17,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:24:17,116 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 22:24:17,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:24:17,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:24:17,178 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 22:24:17,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:17,219 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2373 (Array Int Int)) (|v_node_create_~temp~0#1.base_52| Int)) (or (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_52| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_52| v_ArrVal_2373) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) 1) (not (< |v_node_create_~temp~0#1.base_52| |c_#StackHeapBarrier|)))) is different from false [2023-02-15 22:24:17,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314528096] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:17,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:24:17,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-02-15 22:24:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917715118] [2023-02-15 22:24:17,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:17,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 22:24:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:17,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 22:24:17,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=573, Unknown=3, NotChecked=98, Total=756 [2023-02-15 22:24:17,222 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:24:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:17,779 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2023-02-15 22:24:17,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:24:17,780 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-15 22:24:17,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:17,780 INFO L225 Difference]: With dead ends: 107 [2023-02-15 22:24:17,780 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 22:24:17,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=952, Unknown=5, NotChecked=130, Total=1260 [2023-02-15 22:24:17,781 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 347 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:17,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 470 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 726 Invalid, 3 Unknown, 111 Unchecked, 0.4s Time] [2023-02-15 22:24:17,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 22:24:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2023-02-15 22:24:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.390625) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-02-15 22:24:17,783 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 46 [2023-02-15 22:24:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:17,783 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-02-15 22:24:17,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:24:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-02-15 22:24:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:24:17,783 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:17,783 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:17,805 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 22:24:17,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 22:24:17,984 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:17,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:17,984 INFO L85 PathProgramCache]: Analyzing trace with hash 226118938, now seen corresponding path program 1 times [2023-02-15 22:24:17,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:17,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712888081] [2023-02-15 22:24:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:17,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:18,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:18,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:18,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:24:18,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:18,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712888081] [2023-02-15 22:24:18,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712888081] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:18,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523864780] [2023-02-15 22:24:18,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:18,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:18,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:18,943 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:24:18,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 22:24:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:19,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-15 22:24:19,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:19,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:24:19,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:24:19,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 22:24:19,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:24:19,664 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2614 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_2613 (Array Int Int))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2614)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2613)))) is different from true [2023-02-15 22:24:19,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:19,696 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 22:24:19,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:19,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 22:24:19,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:19,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-02-15 22:24:19,709 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:24:19,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:24:19,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:24:19,759 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 22:24:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 22:24:19,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:20,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523864780] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:20,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:24:20,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2023-02-15 22:24:20,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019670617] [2023-02-15 22:24:20,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:20,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 22:24:20,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:20,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 22:24:20,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=896, Unknown=1, NotChecked=60, Total=1056 [2023-02-15 22:24:20,491 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:24:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:21,496 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2023-02-15 22:24:21,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:24:21,496 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-15 22:24:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:21,497 INFO L225 Difference]: With dead ends: 88 [2023-02-15 22:24:21,497 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 22:24:21,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=199, Invalid=1526, Unknown=1, NotChecked=80, Total=1806 [2023-02-15 22:24:21,499 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 110 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:21,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 740 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1135 Invalid, 0 Unknown, 91 Unchecked, 0.6s Time] [2023-02-15 22:24:21,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 22:24:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-15 22:24:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.375) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-02-15 22:24:21,502 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 46 [2023-02-15 22:24:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:21,502 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-02-15 22:24:21,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:24:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-02-15 22:24:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 22:24:21,503 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:21,503 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2023-02-15 22:24:21,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 22:24:21,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:21,709 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:21,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash 280709232, now seen corresponding path program 1 times [2023-02-15 22:24:21,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:21,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453624135] [2023-02-15 22:24:21,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:21,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:21,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:21,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:22,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:24:22,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:22,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453624135] [2023-02-15 22:24:22,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453624135] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:22,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839821400] [2023-02-15 22:24:22,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:22,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:22,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:22,150 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:24:22,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 22:24:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:22,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 22:24:22,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:22,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:24:22,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:22,688 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 26 treesize of output 19 [2023-02-15 22:24:22,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 22:24:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:24:22,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:22,824 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_17| Int) (v_ArrVal_2903 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_17| v_ArrVal_2903) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (<= 1 .cse0) (not (< |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_17| |c_#StackHeapBarrier|))))) is different from false [2023-02-15 22:24:22,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839821400] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:22,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:24:22,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2023-02-15 22:24:22,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9043855] [2023-02-15 22:24:22,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:22,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 22:24:22,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:22,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 22:24:22,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=669, Unknown=1, NotChecked=52, Total=812 [2023-02-15 22:24:22,826 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 27 states, 25 states have (on average 2.64) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:24:23,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:23,242 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2023-02-15 22:24:23,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:24:23,243 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.64) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-02-15 22:24:23,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:23,244 INFO L225 Difference]: With dead ends: 85 [2023-02-15 22:24:23,244 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 22:24:23,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=1077, Unknown=1, NotChecked=68, Total=1332 [2023-02-15 22:24:23,245 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 288 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:23,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 525 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:24:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 22:24:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-15 22:24:23,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2023-02-15 22:24:23,254 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 51 [2023-02-15 22:24:23,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:23,255 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2023-02-15 22:24:23,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.64) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:24:23,255 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2023-02-15 22:24:23,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 22:24:23,256 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:23,256 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2023-02-15 22:24:23,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 22:24:23,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:23,462 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:23,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:23,462 INFO L85 PathProgramCache]: Analyzing trace with hash 869466270, now seen corresponding path program 1 times [2023-02-15 22:24:23,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:23,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600587029] [2023-02-15 22:24:23,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:23,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:23,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:23,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:23,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 22:24:23,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:23,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600587029] [2023-02-15 22:24:23,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600587029] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:23,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:23,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:24:23,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683503815] [2023-02-15 22:24:23,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:23,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:24:23,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:23,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:24:23,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:24:23,579 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:24:23,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:23,685 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2023-02-15 22:24:23,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:24:23,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2023-02-15 22:24:23,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:23,686 INFO L225 Difference]: With dead ends: 102 [2023-02-15 22:24:23,686 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 22:24:23,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:24:23,687 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 51 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:23,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 282 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:24:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 22:24:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2023-02-15 22:24:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.360655737704918) internal successors, (83), 79 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:23,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-02-15 22:24:23,689 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 52 [2023-02-15 22:24:23,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:23,689 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-02-15 22:24:23,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:24:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-02-15 22:24:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 22:24:23,689 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:23,689 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2023-02-15 22:24:23,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 22:24:23,690 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:23,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash 869466271, now seen corresponding path program 1 times [2023-02-15 22:24:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:23,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245302957] [2023-02-15 22:24:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:23,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:23,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:23,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:23,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 22:24:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:23,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245302957] [2023-02-15 22:24:23,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245302957] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:23,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:23,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:24:23,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016832055] [2023-02-15 22:24:23,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:23,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:24:23,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:23,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:24:23,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:24:23,837 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:24:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:23,951 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2023-02-15 22:24:23,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:24:23,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2023-02-15 22:24:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:23,952 INFO L225 Difference]: With dead ends: 83 [2023-02-15 22:24:23,952 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 22:24:23,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:24:23,952 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 54 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:23,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 292 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:24:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 22:24:23,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-15 22:24:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2023-02-15 22:24:23,954 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 52 [2023-02-15 22:24:23,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:23,954 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2023-02-15 22:24:23,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:24:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2023-02-15 22:24:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:24:23,954 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:23,954 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2023-02-15 22:24:23,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 22:24:23,954 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1183650644, now seen corresponding path program 1 times [2023-02-15 22:24:23,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:23,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046216990] [2023-02-15 22:24:23,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:23,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:24,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:24,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:24,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:24:25,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:25,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046216990] [2023-02-15 22:24:25,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046216990] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:25,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560174642] [2023-02-15 22:24:25,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:25,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:25,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:25,146 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:24:25,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 22:24:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:25,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-15 22:24:25,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:25,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:24:25,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:24:25,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:24:25,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2023-02-15 22:24:25,719 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 18 treesize of output 14 [2023-02-15 22:24:25,723 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:24:25,723 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 7 [2023-02-15 22:24:25,856 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3496)) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3497)) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|)) |c_#valid|))) is different from true [2023-02-15 22:24:25,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:25,884 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:24:25,884 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 35 treesize of output 41 [2023-02-15 22:24:25,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:25,888 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 26 treesize of output 28 [2023-02-15 22:24:25,903 INFO L321 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2023-02-15 22:24:25,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 64 [2023-02-15 22:24:25,977 INFO L321 Elim1Store]: treesize reduction 71, result has 26.0 percent of original size [2023-02-15 22:24:25,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 44 [2023-02-15 22:24:26,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:24:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 22:24:26,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:26,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560174642] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:26,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:24:26,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 37 [2023-02-15 22:24:26,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928713620] [2023-02-15 22:24:26,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:26,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 22:24:26,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:26,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 22:24:26,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1442, Unknown=1, NotChecked=76, Total=1640 [2023-02-15 22:24:26,236 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 38 states, 35 states have (on average 2.2) internal successors, (77), 33 states have internal predecessors, (77), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:24:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:27,783 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2023-02-15 22:24:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 22:24:27,783 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.2) internal successors, (77), 33 states have internal predecessors, (77), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2023-02-15 22:24:27,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:27,784 INFO L225 Difference]: With dead ends: 100 [2023-02-15 22:24:27,784 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 22:24:27,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=395, Invalid=2914, Unknown=1, NotChecked=112, Total=3422 [2023-02-15 22:24:27,785 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 493 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:27,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 807 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1301 Invalid, 0 Unknown, 84 Unchecked, 0.6s Time] [2023-02-15 22:24:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 22:24:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2023-02-15 22:24:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 77 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-02-15 22:24:27,787 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 53 [2023-02-15 22:24:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:27,787 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-02-15 22:24:27,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.2) internal successors, (77), 33 states have internal predecessors, (77), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:24:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-02-15 22:24:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:24:27,788 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:27,788 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2023-02-15 22:24:27,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 22:24:27,993 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,SelfDestructingSolverStorable22 [2023-02-15 22:24:27,994 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:27,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1183650645, now seen corresponding path program 1 times [2023-02-15 22:24:27,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:27,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687278577] [2023-02-15 22:24:27,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:27,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:28,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:28,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:28,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:24:29,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:29,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687278577] [2023-02-15 22:24:29,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687278577] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:29,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037986295] [2023-02-15 22:24:29,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:29,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:29,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:29,538 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:24:29,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 22:24:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:29,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 119 conjunts are in the unsatisfiable core [2023-02-15 22:24:29,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:29,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:24:29,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:24:30,163 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:24:30,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:24:30,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:24:30,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:24:30,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:24:30,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:24:30,678 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 63 treesize of output 30 [2023-02-15 22:24:30,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:24:30,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:24:30,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:24:30,824 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3792 (Array Int Int)) (v_ArrVal_3793 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3792)) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3793)))) is different from true [2023-02-15 22:24:30,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:30,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:30,855 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:24:30,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 22:24:30,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:30,871 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:24:30,871 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 69 treesize of output 59 [2023-02-15 22:24:30,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:30,877 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 22 treesize of output 17 [2023-02-15 22:24:30,890 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:24:30,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:24:30,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:24:31,004 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-02-15 22:24:31,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 31 [2023-02-15 22:24:31,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:24:31,090 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 48 treesize of output 19 [2023-02-15 22:24:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 22:24:31,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:32,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037986295] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:32,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:24:32,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2023-02-15 22:24:32,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47107060] [2023-02-15 22:24:32,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:32,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 22:24:32,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:32,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 22:24:32,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2369, Unknown=1, NotChecked=98, Total=2652 [2023-02-15 22:24:32,642 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 47 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:24:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:34,307 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2023-02-15 22:24:34,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 22:24:34,307 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2023-02-15 22:24:34,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:34,308 INFO L225 Difference]: With dead ends: 99 [2023-02-15 22:24:34,308 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 22:24:34,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=474, Invalid=4085, Unknown=1, NotChecked=132, Total=4692 [2023-02-15 22:24:34,309 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 416 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:34,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 567 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1112 Invalid, 0 Unknown, 83 Unchecked, 0.6s Time] [2023-02-15 22:24:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 22:24:34,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2023-02-15 22:24:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-15 22:24:34,311 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 53 [2023-02-15 22:24:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:34,311 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-15 22:24:34,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:24:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-15 22:24:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 22:24:34,311 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:34,311 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:34,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 22:24:34,518 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,SelfDestructingSolverStorable23 [2023-02-15 22:24:34,518 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:34,519 INFO L85 PathProgramCache]: Analyzing trace with hash -939292314, now seen corresponding path program 1 times [2023-02-15 22:24:34,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:34,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980474827] [2023-02-15 22:24:34,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:34,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:35,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:35,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:35,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:24:35,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:35,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980474827] [2023-02-15 22:24:35,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980474827] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:35,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:35,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2023-02-15 22:24:35,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094458073] [2023-02-15 22:24:35,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:35,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 22:24:35,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:35,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 22:24:35,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2023-02-15 22:24:35,396 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 24 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:24:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:36,177 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2023-02-15 22:24:36,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 22:24:36,177 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2023-02-15 22:24:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:36,178 INFO L225 Difference]: With dead ends: 102 [2023-02-15 22:24:36,178 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 22:24:36,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 22:24:36,178 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 625 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:36,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 423 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:24:36,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 22:24:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 81. [2023-02-15 22:24:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:24:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2023-02-15 22:24:36,180 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 58 [2023-02-15 22:24:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:36,180 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2023-02-15 22:24:36,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:24:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2023-02-15 22:24:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 22:24:36,180 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:36,181 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:24:36,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-15 22:24:36,181 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:24:36,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:36,181 INFO L85 PathProgramCache]: Analyzing trace with hash -939292313, now seen corresponding path program 1 times [2023-02-15 22:24:36,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:36,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007522581] [2023-02-15 22:24:36,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:36,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:37,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:37,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:37,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:24:37,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:37,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007522581] [2023-02-15 22:24:37,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007522581] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:37,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498691430] [2023-02-15 22:24:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:37,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:37,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:37,757 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:24:37,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 22:24:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:38,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 132 conjunts are in the unsatisfiable core [2023-02-15 22:24:38,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:38,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:24:38,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:24:38,195 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:24:38,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:24:38,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:24:38,388 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:24:38,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2023-02-15 22:24:38,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:24:38,756 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 22:24:38,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 17 [2023-02-15 22:24:38,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:24:38,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:24:39,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:39,101 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 27 [2023-02-15 22:24:39,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:39,111 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:24:39,111 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 42 treesize of output 46 [2023-02-15 22:24:39,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:39,123 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:24:39,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-02-15 22:24:39,695 INFO L321 Elim1Store]: treesize reduction 61, result has 17.6 percent of original size [2023-02-15 22:24:39,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 42 [2023-02-15 22:24:39,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-02-15 22:24:39,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:39,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:24:39,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:39,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2023-02-15 22:24:39,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 22:24:39,879 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 14 treesize of output 16 [2023-02-15 22:24:39,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:24:39,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:24:39,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:24:40,047 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:24:40,048 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 39 treesize of output 38 [2023-02-15 22:24:40,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:40,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 22:24:40,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 22:24:40,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:24:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 7 refuted. 7 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:24:40,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:40,333 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4297) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4297 (Array Int Int)) (v_ArrVal_4298 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4297) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4298) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 22:25:04,022 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 388 treesize of output 326 [2023-02-15 22:25:04,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498691430] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:25:04,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:25:04,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 62 [2023-02-15 22:25:04,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678427495] [2023-02-15 22:25:04,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:25:04,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-02-15 22:25:04,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:25:04,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-02-15 22:25:04,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=5487, Unknown=117, NotChecked=150, Total=6006 [2023-02-15 22:25:04,390 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 63 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 54 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:25:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:25:09,269 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2023-02-15 22:25:09,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 22:25:09,270 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 54 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2023-02-15 22:25:09,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:25:09,271 INFO L225 Difference]: With dead ends: 104 [2023-02-15 22:25:09,271 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 22:25:09,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2322 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=878, Invalid=9719, Unknown=119, NotChecked=204, Total=10920 [2023-02-15 22:25:09,278 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1287 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 85 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:25:09,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 945 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2216 Invalid, 2 Unknown, 0 Unchecked, 1.3s Time] [2023-02-15 22:25:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 22:25:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 83. [2023-02-15 22:25:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:25:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2023-02-15 22:25:09,280 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 58 [2023-02-15 22:25:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:25:09,280 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2023-02-15 22:25:09,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 54 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:25:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2023-02-15 22:25:09,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 22:25:09,284 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:25:09,284 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:25:09,313 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 22:25:09,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:25:09,491 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-15 22:25:09,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:25:09,491 INFO L85 PathProgramCache]: Analyzing trace with hash -716779287, now seen corresponding path program 1 times [2023-02-15 22:25:09,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:25:09,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056592564] [2023-02-15 22:25:09,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:25:09,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:25:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:25:11,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:25:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:25:11,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:25:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:25:11,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:25:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:25:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:25:12,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:25:12,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056592564] [2023-02-15 22:25:12,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056592564] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:25:12,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382794391] [2023-02-15 22:25:12,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:25:12,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:25:12,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:25:12,767 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:25:12,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 22:25:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:25:13,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 156 conjunts are in the unsatisfiable core [2023-02-15 22:25:13,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:25:13,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:25:13,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:25:13,496 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:25:13,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:25:13,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:25:14,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:25:14,100 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 41 treesize of output 20 [2023-02-15 22:25:14,106 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:25:14,106 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 7 [2023-02-15 22:25:14,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:25:14,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:25:14,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:14,481 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 22:25:14,481 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 53 treesize of output 44 [2023-02-15 22:25:14,500 INFO L321 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2023-02-15 22:25:14,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:25:14,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:14,519 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 16 treesize of output 11 [2023-02-15 22:25:15,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:15,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:25:15,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:15,425 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:25:15,428 INFO L321 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2023-02-15 22:25:15,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 55 [2023-02-15 22:25:15,435 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 0 case distinctions, treesize of input 32 treesize of output 20 [2023-02-15 22:25:15,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:15,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:25:15,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:15,561 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 19 treesize of output 18 [2023-02-15 22:25:15,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:15,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:15,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2023-02-15 22:25:15,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:15,662 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 0 case distinctions, treesize of input 38 treesize of output 34 [2023-02-15 22:25:15,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:15,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:25:15,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:25:15,679 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 19 treesize of output 13 [2023-02-15 22:25:15,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:15,773 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 19 treesize of output 18 [2023-02-15 22:25:15,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:15,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:25:15,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:25:15,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:15,909 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-02-15 22:25:15,909 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 85 treesize of output 79 [2023-02-15 22:25:15,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:15,915 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 37 treesize of output 32 [2023-02-15 22:25:15,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:15,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 22:25:16,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:16,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-02-15 22:25:16,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:25:16,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:25:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:25:16,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:25:16,496 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4633 Int) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4629 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |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_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:25:16,504 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4633 Int) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4626) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4625))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4627) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:25:16,515 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4622 Int) (v_ArrVal_4633 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4623 (Array Int Int)) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4624 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (select (select (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_4622)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4626) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4623) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4625))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4624) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4627) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:25:16,527 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4622 Int) (v_ArrVal_4633 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4623 (Array Int Int)) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4624 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4616 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_4616))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_4622))) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4626) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4623) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4625))) (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4624) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4627) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:25:16,541 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4622 Int) (v_ArrVal_4633 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4623 (Array Int Int)) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4624 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4616 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_4616))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_4622))) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_4626) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4623) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_4625))) (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4624) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_4627) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:25:16,556 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4622 Int) (v_ArrVal_4633 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4623 (Array Int Int)) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4624 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4616 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_4616))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_4622))) .cse2 v_ArrVal_4626) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse3 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4623) .cse2 v_ArrVal_4625))) (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4624) .cse2 v_ArrVal_4627) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:25:16,582 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4622 Int) (v_ArrVal_4633 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4623 (Array Int Int)) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4624 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4616 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_4616))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_4622))) .cse2 v_ArrVal_4626) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse3 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4623) .cse2 v_ArrVal_4625))) (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4624) .cse2 v_ArrVal_4627) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:25:17,862 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4622 Int) (v_ArrVal_4633 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4623 (Array Int Int)) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4624 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4616 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (+ (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_4616))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_4622))) .cse2 v_ArrVal_4626) .cse3 v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4623) .cse2 v_ArrVal_4625))) (store .cse4 .cse3 (store (select .cse4 .cse3) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4624) .cse2 v_ArrVal_4627) .cse3 v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:25:17,896 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4622 Int) (v_ArrVal_4633 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4623 (Array Int Int)) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4624 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4616 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (+ (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_4616))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| v_ArrVal_4622))) .cse2 v_ArrVal_4626) .cse3 v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4623) .cse2 v_ArrVal_4625))) (store .cse4 .cse3 (store (select .cse4 .cse3) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4624) .cse2 v_ArrVal_4627) .cse3 v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:25:17,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:25:17,992 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 324 treesize of output 301 [2023-02-15 22:25:18,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:25:18,195 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 46027806 treesize of output 45495895 [2023-02-15 22:25:25,023 WARN L233 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 3796 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-15 22:25:26,572 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 52082134 treesize of output 46675414 [2023-02-15 22:25:35,092 WARN L233 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 3601 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-15 22:25:36,544 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 48870870 treesize of output 46691798 [2023-02-15 22:25:45,640 WARN L233 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 3561 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-15 22:25:47,005 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 47809750 treesize of output 47125718 [2023-02-15 22:25:56,458 WARN L233 SmtUtils]: Spent 9.45s on a formula simplification that was a NOOP. DAG size: 3567 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-15 22:27:05,657 WARN L233 SmtUtils]: Spent 36.42s on a formula simplification. DAG size of input: 3555 DAG size of output: 3555 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-15 22:28:19,545 WARN L233 SmtUtils]: Spent 1.07m on a formula simplification. DAG size of input: 3552 DAG size of output: 3552 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)