./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.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 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:34:46,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:34:46,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:34:46,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:34:46,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:34:46,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:34:46,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:34:46,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:34:46,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:34:46,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:34:46,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:34:46,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:34:46,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:34:46,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:34:46,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:34:46,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:34:46,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:34:46,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:34:46,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:34:46,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:34:46,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:34:46,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:34:46,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:34:46,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:34:46,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:34:46,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:34:46,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:34:46,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:34:46,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:34:46,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:34:46,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:34:46,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:34:46,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:34:46,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:34:46,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:34:46,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:34:46,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:34:46,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:34:46,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:34:46,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:34:46,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:34:46,139 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:34:46,176 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:34:46,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:34:46,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:34:46,177 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:34:46,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:34:46,178 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:34:46,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:34:46,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:34:46,179 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:34:46,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:34:46,180 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:34:46,180 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:34:46,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:34:46,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:34:46,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:34:46,181 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:34:46,181 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:34:46,181 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:34:46,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:34:46,182 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:34:46,182 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:34:46,182 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:34:46,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:34:46,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:34:46,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:34:46,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:34:46,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:34:46,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:34:46,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:34:46,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:34:46,184 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:34:46,184 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:34:46,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:34:46,185 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:34:46,185 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 -> 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 [2023-02-15 01:34:46,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:34:46,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:34:46,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:34:46,455 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:34:46,455 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:34:46,456 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2023-02-15 01:34:47,600 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:34:47,830 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:34:47,830 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2023-02-15 01:34:47,846 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60ae0b9f6/97bdad7f738c4213bf1774e0b8babc72/FLAG91ba79204 [2023-02-15 01:34:47,862 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60ae0b9f6/97bdad7f738c4213bf1774e0b8babc72 [2023-02-15 01:34:47,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:34:47,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:34:47,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:34:47,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:34:47,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:34:47,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:34:47" (1/1) ... [2023-02-15 01:34:47,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11113900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:47, skipping insertion in model container [2023-02-15 01:34:47,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:34:47" (1/1) ... [2023-02-15 01:34:47,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:34:47,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:34:48,220 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_unequal.i[24729,24742] [2023-02-15 01:34:48,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:34:48,234 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:34:48,278 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_unequal.i[24729,24742] [2023-02-15 01:34:48,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:34:48,302 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:34:48,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:48 WrapperNode [2023-02-15 01:34:48,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:34:48,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:34:48,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:34:48,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:34:48,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:48" (1/1) ... [2023-02-15 01:34:48,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:48" (1/1) ... [2023-02-15 01:34:48,369 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2023-02-15 01:34:48,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:34:48,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:34:48,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:34:48,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:34:48,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:48" (1/1) ... [2023-02-15 01:34:48,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:48" (1/1) ... [2023-02-15 01:34:48,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:48" (1/1) ... [2023-02-15 01:34:48,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:48" (1/1) ... [2023-02-15 01:34:48,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:48" (1/1) ... [2023-02-15 01:34:48,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:48" (1/1) ... [2023-02-15 01:34:48,404 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:48" (1/1) ... [2023-02-15 01:34:48,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:48" (1/1) ... [2023-02-15 01:34:48,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:34:48,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:34:48,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:34:48,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:34:48,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:48" (1/1) ... [2023-02-15 01:34:48,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:34:48,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:34:48,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 01:34:48,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 01:34:48,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 01:34:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 01:34:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 01:34:48,472 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 01:34:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:34:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:34:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 01:34:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:34:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:34:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:34:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 01:34:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:34:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:34:48,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:34:48,586 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:34:48,588 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:34:49,043 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:34:49,049 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:34:49,049 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 01:34:49,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:34:49 BoogieIcfgContainer [2023-02-15 01:34:49,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:34:49,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:34:49,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:34:49,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:34:49,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:34:47" (1/3) ... [2023-02-15 01:34:49,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efc37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:34:49, skipping insertion in model container [2023-02-15 01:34:49,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:48" (2/3) ... [2023-02-15 01:34:49,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efc37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:34:49, skipping insertion in model container [2023-02-15 01:34:49,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:34:49" (3/3) ... [2023-02-15 01:34:49,065 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2023-02-15 01:34:49,080 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:34:49,080 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-02-15 01:34:49,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:34:49,141 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;@71031af2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:34:49,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-02-15 01:34:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:34:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:34:49,151 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:49,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:34:49,153 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:49,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:49,159 INFO L85 PathProgramCache]: Analyzing trace with hash 895672562, now seen corresponding path program 1 times [2023-02-15 01:34:49,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:49,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822082669] [2023-02-15 01:34:49,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:49,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:34:49,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:49,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822082669] [2023-02-15 01:34:49,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822082669] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:34:49,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:34:49,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:34:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027727620] [2023-02-15 01:34:49,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:34:49,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:34:49,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:49,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:34:49,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:34:49,454 INFO L87 Difference]: Start difference. First operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 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 01:34:49,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:49,568 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2023-02-15 01:34:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:34:49,571 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 01:34:49,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:49,577 INFO L225 Difference]: With dead ends: 135 [2023-02-15 01:34:49,578 INFO L226 Difference]: Without dead ends: 132 [2023-02-15 01:34:49,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:34:49,582 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:49,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 207 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:34:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-15 01:34:49,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2023-02-15 01:34:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 67 states have (on average 2.014925373134328) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:34:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2023-02-15 01:34:49,620 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2023-02-15 01:34:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:49,621 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2023-02-15 01:34:49,622 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 01:34:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2023-02-15 01:34:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:34:49,622 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:49,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:34:49,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:34:49,623 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash 895672563, now seen corresponding path program 1 times [2023-02-15 01:34:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:49,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523327151] [2023-02-15 01:34:49,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:49,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:34:49,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:49,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523327151] [2023-02-15 01:34:49,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523327151] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:34:49,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:34:49,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:34:49,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928634766] [2023-02-15 01:34:49,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:34:49,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:34:49,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:49,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:34:49,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:34:49,779 INFO L87 Difference]: Start difference. First operand 132 states and 141 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 01:34:49,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:49,889 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2023-02-15 01:34:49,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:34:49,890 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 01:34:49,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:49,891 INFO L225 Difference]: With dead ends: 129 [2023-02-15 01:34:49,891 INFO L226 Difference]: Without dead ends: 129 [2023-02-15 01:34:49,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:34:49,893 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:49,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 209 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:34:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-15 01:34:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-02-15 01:34:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 124 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:34:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2023-02-15 01:34:49,904 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 6 [2023-02-15 01:34:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:49,905 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2023-02-15 01:34:49,905 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 01:34:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2023-02-15 01:34:49,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 01:34:49,906 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:49,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:34:49,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:34:49,907 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:49,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:49,907 INFO L85 PathProgramCache]: Analyzing trace with hash -753542016, now seen corresponding path program 1 times [2023-02-15 01:34:49,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:49,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495605673] [2023-02-15 01:34:49,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:50,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:34:50,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:50,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495605673] [2023-02-15 01:34:50,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495605673] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:34:50,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:34:50,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:34:50,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504875399] [2023-02-15 01:34:50,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:34:50,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:34:50,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:50,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:34:50,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:34:50,066 INFO L87 Difference]: Start difference. First operand 129 states and 138 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 01:34:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:50,214 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2023-02-15 01:34:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:34:50,215 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 01:34:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:50,220 INFO L225 Difference]: With dead ends: 140 [2023-02-15 01:34:50,220 INFO L226 Difference]: Without dead ends: 140 [2023-02-15 01:34:50,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:34:50,226 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:50,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 313 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:34:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-15 01:34:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2023-02-15 01:34:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 125 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:34:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2023-02-15 01:34:50,249 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 14 [2023-02-15 01:34:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:50,249 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2023-02-15 01:34:50,250 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 01:34:50,250 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2023-02-15 01:34:50,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 01:34:50,252 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:50,252 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 01:34:50,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:34:50,252 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:50,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:50,253 INFO L85 PathProgramCache]: Analyzing trace with hash 265974304, now seen corresponding path program 1 times [2023-02-15 01:34:50,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:50,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560780499] [2023-02-15 01:34:50,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:50,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:50,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:50,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:34:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:50,519 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 01:34:50,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:50,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560780499] [2023-02-15 01:34:50,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560780499] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:34:50,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:34:50,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:34:50,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61957884] [2023-02-15 01:34:50,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:34:50,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:34:50,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:50,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:34:50,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:34:50,524 INFO L87 Difference]: Start difference. First operand 130 states and 139 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 01:34:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:50,801 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2023-02-15 01:34:50,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:34:50,802 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 01:34:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:50,804 INFO L225 Difference]: With dead ends: 130 [2023-02-15 01:34:50,805 INFO L226 Difference]: Without dead ends: 130 [2023-02-15 01:34:50,805 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 01:34:50,815 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 21 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:50,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 426 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:34:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-15 01:34:50,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2023-02-15 01:34:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 124 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:34:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2023-02-15 01:34:50,836 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 24 [2023-02-15 01:34:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:50,836 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2023-02-15 01:34:50,836 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 01:34:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2023-02-15 01:34:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 01:34:50,837 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:50,838 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 01:34:50,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:34:50,838 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:50,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:50,839 INFO L85 PathProgramCache]: Analyzing trace with hash 265974305, now seen corresponding path program 1 times [2023-02-15 01:34:50,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:50,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464388466] [2023-02-15 01:34:50,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:50,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:51,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:51,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:34:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:51,095 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 01:34:51,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:51,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464388466] [2023-02-15 01:34:51,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464388466] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:34:51,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:34:51,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:34:51,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430075954] [2023-02-15 01:34:51,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:34:51,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:34:51,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:51,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:34:51,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:34:51,098 INFO L87 Difference]: Start difference. First operand 129 states and 138 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 01:34:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:51,345 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2023-02-15 01:34:51,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:34:51,345 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 01:34:51,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:51,346 INFO L225 Difference]: With dead ends: 129 [2023-02-15 01:34:51,346 INFO L226 Difference]: Without dead ends: 129 [2023-02-15 01:34:51,347 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 01:34:51,347 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 19 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:51,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 450 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:34:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-15 01:34:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2023-02-15 01:34:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 123 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:34:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2023-02-15 01:34:51,354 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 24 [2023-02-15 01:34:51,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:51,355 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2023-02-15 01:34:51,355 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 01:34:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2023-02-15 01:34:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 01:34:51,356 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:51,356 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 01:34:51,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:34:51,356 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:51,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:51,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731903, now seen corresponding path program 1 times [2023-02-15 01:34:51,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:51,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190540056] [2023-02-15 01:34:51,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:51,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:51,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:34:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:51,602 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 01:34:51,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:51,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190540056] [2023-02-15 01:34:51,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190540056] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:51,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935124745] [2023-02-15 01:34:51,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:51,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:34:51,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:34:51,613 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:34:51,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 01:34:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:51,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 01:34:51,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:34:51,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 01:34:51,859 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 01:34:51,932 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:34:51,932 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 01:34:51,943 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 01:34:51,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:34:51,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935124745] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:51,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:34:51,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-02-15 01:34:51,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720359224] [2023-02-15 01:34:51,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:34:51,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:34:51,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:51,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:34:51,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-02-15 01:34:51,997 INFO L87 Difference]: Start difference. First operand 128 states and 137 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 01:34:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:52,354 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2023-02-15 01:34:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:34:52,355 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 01:34:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:52,356 INFO L225 Difference]: With dead ends: 153 [2023-02-15 01:34:52,356 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 01:34:52,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 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 01:34:52,357 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 107 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:52,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 404 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 453 Invalid, 0 Unknown, 158 Unchecked, 0.3s Time] [2023-02-15 01:34:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 01:34:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2023-02-15 01:34:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.9027777777777777) internal successors, (137), 127 states have internal predecessors, (137), 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 01:34:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2023-02-15 01:34:52,364 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 26 [2023-02-15 01:34:52,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:52,364 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2023-02-15 01:34:52,365 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 01:34:52,365 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2023-02-15 01:34:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 01:34:52,366 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:52,366 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 01:34:52,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 01:34:52,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 01:34:52,573 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:52,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:52,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731902, now seen corresponding path program 1 times [2023-02-15 01:34:52,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:52,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951651989] [2023-02-15 01:34:52,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:52,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:52,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:52,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:34:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:52,950 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 01:34:52,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:52,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951651989] [2023-02-15 01:34:52,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951651989] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:52,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136552088] [2023-02-15 01:34:52,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:52,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:34:52,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:34:52,957 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:34:52,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 01:34:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:53,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 01:34:53,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:34:53,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:34:53,323 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:34:53,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 01:34:53,336 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:34:53,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:34:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:34:53,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:34:53,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136552088] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:53,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:34:53,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2023-02-15 01:34:53,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517148803] [2023-02-15 01:34:53,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:34:53,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 01:34:53,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:53,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 01:34:53,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2023-02-15 01:34:53,516 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) 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 01:34:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:54,379 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2023-02-15 01:34:54,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:34:54,380 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) 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 01:34:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:54,381 INFO L225 Difference]: With dead ends: 135 [2023-02-15 01:34:54,381 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 01:34:54,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2023-02-15 01:34:54,382 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 15 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:54,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 976 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 01:34:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 01:34:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2023-02-15 01:34:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 127 states have internal predecessors, (136), 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 01:34:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2023-02-15 01:34:54,387 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 26 [2023-02-15 01:34:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:54,387 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2023-02-15 01:34:54,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) 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 01:34:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2023-02-15 01:34:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 01:34:54,388 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:54,388 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 01:34:54,400 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 01:34:54,588 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 01:34:54,589 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:54,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:54,589 INFO L85 PathProgramCache]: Analyzing trace with hash -619542825, now seen corresponding path program 1 times [2023-02-15 01:34:54,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:54,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401450935] [2023-02-15 01:34:54,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:54,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:54,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:34:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:54,743 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 01:34:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:54,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401450935] [2023-02-15 01:34:54,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401450935] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:54,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133818410] [2023-02-15 01:34:54,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:54,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:34:54,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:34:54,746 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:34:54,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 01:34:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:54,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 01:34:54,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:34:54,909 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 01:34:54,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:34:54,969 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 01:34:54,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133818410] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:34:54,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:34:54,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-02-15 01:34:54,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496233955] [2023-02-15 01:34:54,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:34:54,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:34:54,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:54,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:34:54,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:34:54,972 INFO L87 Difference]: Start difference. First operand 133 states and 144 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 01:34:55,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:55,126 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2023-02-15 01:34:55,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:34:55,127 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 01:34:55,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:55,128 INFO L225 Difference]: With dead ends: 134 [2023-02-15 01:34:55,128 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 01:34:55,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:34:55,129 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 4 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:55,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 660 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:34:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 01:34:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2023-02-15 01:34:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 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 01:34:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2023-02-15 01:34:55,134 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 28 [2023-02-15 01:34:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:55,134 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2023-02-15 01:34:55,134 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 01:34:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2023-02-15 01:34:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 01:34:55,135 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:55,135 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 01:34:55,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 01:34:55,340 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 01:34:55,341 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:55,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739054, now seen corresponding path program 1 times [2023-02-15 01:34:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:55,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720123707] [2023-02-15 01:34:55,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:55,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:55,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:55,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:34:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:55,446 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 01:34:55,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:55,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720123707] [2023-02-15 01:34:55,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720123707] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:55,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158567113] [2023-02-15 01:34:55,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:55,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:34:55,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:34:55,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:34:55,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 01:34:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:55,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 01:34:55,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:34:55,597 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 01:34:55,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:34:55,607 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:34:55,607 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 01:34:55,624 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 01:34:55,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158567113] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:34:55,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:34:55,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-02-15 01:34:55,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974172589] [2023-02-15 01:34:55,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:34:55,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:34:55,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:55,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:34:55,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:34:55,627 INFO L87 Difference]: Start difference. First operand 133 states and 143 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 01:34:55,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:55,799 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2023-02-15 01:34:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:34:55,800 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 01:34:55,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:55,801 INFO L225 Difference]: With dead ends: 138 [2023-02-15 01:34:55,801 INFO L226 Difference]: Without dead ends: 138 [2023-02-15 01:34:55,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:34:55,802 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 11 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:55,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 429 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:34:55,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-15 01:34:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2023-02-15 01:34:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 130 states have internal predecessors, (140), 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 01:34:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2023-02-15 01:34:55,806 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 29 [2023-02-15 01:34:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:55,807 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2023-02-15 01:34:55,807 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 01:34:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2023-02-15 01:34:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 01:34:55,808 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:55,808 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 01:34:55,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 01:34:56,017 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 01:34:56,017 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:56,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739053, now seen corresponding path program 1 times [2023-02-15 01:34:56,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:56,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106815155] [2023-02-15 01:34:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:56,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:56,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:56,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:34:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:56,207 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 01:34:56,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:56,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106815155] [2023-02-15 01:34:56,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106815155] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:56,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469941760] [2023-02-15 01:34:56,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:56,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:34:56,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:34:56,209 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:34:56,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 01:34:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:56,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 01:34:56,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:34:56,456 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 01:34:56,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:34:56,487 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:34:56,488 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 01:34:56,605 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 01:34:56,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469941760] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:34:56,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:34:56,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-02-15 01:34:56,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630298775] [2023-02-15 01:34:56,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:34:56,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 01:34:56,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:56,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 01:34:56,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-02-15 01:34:56,609 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 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 01:34:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:56,923 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2023-02-15 01:34:56,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:34:56,923 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 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 01:34:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:56,924 INFO L225 Difference]: With dead ends: 143 [2023-02-15 01:34:56,924 INFO L226 Difference]: Without dead ends: 143 [2023-02-15 01:34:56,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-02-15 01:34:56,925 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 21 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:56,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1191 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:34:56,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-02-15 01:34:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2023-02-15 01:34:56,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 130 states have internal predecessors, (139), 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 01:34:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2023-02-15 01:34:56,928 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 29 [2023-02-15 01:34:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:56,928 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2023-02-15 01:34:56,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 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 01:34:56,929 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2023-02-15 01:34:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:34:56,929 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:56,929 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 01:34:56,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 01:34:57,133 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 01:34:57,133 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:57,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598771, now seen corresponding path program 1 times [2023-02-15 01:34:57,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:57,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538026582] [2023-02-15 01:34:57,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:57,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:57,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:57,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:34:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:57,260 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 01:34:57,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:57,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538026582] [2023-02-15 01:34:57,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538026582] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:34:57,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:34:57,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:34:57,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601265009] [2023-02-15 01:34:57,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:34:57,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:34:57,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:57,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:34:57,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:34:57,262 INFO L87 Difference]: Start difference. First operand 136 states and 147 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 01:34:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:57,529 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2023-02-15 01:34:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:34:57,530 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 01:34:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:57,531 INFO L225 Difference]: With dead ends: 136 [2023-02-15 01:34:57,531 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 01:34:57,531 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 01:34:57,532 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 24 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:57,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 475 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:34:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 01:34:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2023-02-15 01:34:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.84) internal successors, (138), 129 states have internal predecessors, (138), 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 01:34:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2023-02-15 01:34:57,535 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 30 [2023-02-15 01:34:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:57,536 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2023-02-15 01:34:57,536 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 01:34:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2023-02-15 01:34:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:34:57,537 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:57,537 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 01:34:57,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 01:34:57,537 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:57,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:57,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598772, now seen corresponding path program 1 times [2023-02-15 01:34:57,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:57,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026427696] [2023-02-15 01:34:57,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:57,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:57,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:57,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:34:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:57,734 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 01:34:57,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:57,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026427696] [2023-02-15 01:34:57,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026427696] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:34:57,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:34:57,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:34:57,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346181164] [2023-02-15 01:34:57,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:34:57,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:34:57,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:57,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:34:57,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:34:57,737 INFO L87 Difference]: Start difference. First operand 135 states and 146 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 01:34:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:57,988 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2023-02-15 01:34:57,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:34:57,989 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 01:34:57,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:57,990 INFO L225 Difference]: With dead ends: 134 [2023-02-15 01:34:57,990 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 01:34:57,990 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 01:34:57,991 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 20 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:57,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 505 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:34:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 01:34:57,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-02-15 01:34:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 128 states have internal predecessors, (137), 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 01:34:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2023-02-15 01:34:57,994 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 30 [2023-02-15 01:34:57,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:57,994 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2023-02-15 01:34:57,994 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 01:34:57,994 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2023-02-15 01:34:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 01:34:57,995 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:57,995 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 01:34:57,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 01:34:57,995 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:57,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash 939320083, now seen corresponding path program 1 times [2023-02-15 01:34:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:57,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615633868] [2023-02-15 01:34:57,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:57,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:34:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-15 01:34:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,112 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 01:34:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:58,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615633868] [2023-02-15 01:34:58,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615633868] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:58,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244371927] [2023-02-15 01:34:58,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:58,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:34:58,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:34:58,117 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:34:58,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 01:34:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:34:58,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:34:58,309 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 01:34:58,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:34:58,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244371927] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:34:58,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:34:58,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-15 01:34:58,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444343440] [2023-02-15 01:34:58,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:34:58,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:34:58,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:58,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:34:58,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:34:58,313 INFO L87 Difference]: Start difference. First operand 134 states and 145 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 01:34:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:58,322 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2023-02-15 01:34:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:34:58,323 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 01:34:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:58,324 INFO L225 Difference]: With dead ends: 122 [2023-02-15 01:34:58,324 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 01:34:58,324 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 01:34:58,325 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 107 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 153 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 01:34:58,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 153 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:34:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 01:34:58,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-02-15 01:34:58,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8088235294117647) internal successors, (123), 117 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 01:34:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2023-02-15 01:34:58,330 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 41 [2023-02-15 01:34:58,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:58,331 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2023-02-15 01:34:58,331 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 01:34:58,331 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2023-02-15 01:34:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 01:34:58,334 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:58,335 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 01:34:58,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 01:34:58,540 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 01:34:58,541 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:58,542 INFO L85 PathProgramCache]: Analyzing trace with hash -566913869, now seen corresponding path program 1 times [2023-02-15 01:34:58,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:58,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991763742] [2023-02-15 01:34:58,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:58,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:34:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:34:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:34:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,959 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 01:34:58,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:58,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991763742] [2023-02-15 01:34:58,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991763742] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:58,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082641003] [2023-02-15 01:34:58,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:58,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:34:58,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:34:58,962 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:34:58,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 01:34:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:59,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 01:34:59,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:34:59,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:34:59,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:34:59,210 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1582 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582))))) is different from true [2023-02-15 01:34:59,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:59,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:34:59,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:34:59,274 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 01:34:59,293 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:34:59,294 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 01:34:59,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:34:59,359 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1584 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1584))))) is different from true [2023-02-15 01:34:59,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:34:59,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:34:59,406 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 01:34:59,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:34:59,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082641003] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:59,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:34:59,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-15 01:34:59,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602432376] [2023-02-15 01:34:59,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:34:59,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 01:34:59,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:59,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 01:34:59,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=125, Unknown=3, NotChecked=72, Total=240 [2023-02-15 01:34:59,454 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 01:34:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:59,760 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2023-02-15 01:34:59,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:34:59,761 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2023-02-15 01:34:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:59,762 INFO L225 Difference]: With dead ends: 132 [2023-02-15 01:34:59,762 INFO L226 Difference]: Without dead ends: 132 [2023-02-15 01:34:59,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=166, Unknown=3, NotChecked=84, Total=306 [2023-02-15 01:34:59,762 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 185 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:59,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 262 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 357 Invalid, 0 Unknown, 342 Unchecked, 0.3s Time] [2023-02-15 01:34:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-15 01:34:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2023-02-15 01:34:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 68 states have (on average 1.6911764705882353) internal successors, (115), 109 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:34:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2023-02-15 01:34:59,765 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 43 [2023-02-15 01:34:59,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:59,766 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2023-02-15 01:34:59,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 01:34:59,766 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2023-02-15 01:34:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 01:34:59,766 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:59,766 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 01:34:59,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 01:34:59,967 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 01:34:59,967 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:34:59,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:59,968 INFO L85 PathProgramCache]: Analyzing trace with hash -566913868, now seen corresponding path program 1 times [2023-02-15 01:34:59,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:59,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400505037] [2023-02-15 01:34:59,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:59,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:00,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:00,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:00,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 01:35:00,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:00,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400505037] [2023-02-15 01:35:00,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400505037] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:00,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322548241] [2023-02-15 01:35:00,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:00,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:00,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:00,527 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:00,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 01:35:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:00,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 01:35:00,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:00,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:35:00,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:35:00,758 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1821 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1821) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 01:35:00,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:00,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:35:00,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:35:00,812 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1822 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1822))))) is different from true [2023-02-15 01:35:00,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:00,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:35:00,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:35:00,899 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1823 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1823) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 01:35:00,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:00,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:35:00,957 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 01:35:00,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:01,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322548241] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:01,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:01,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2023-02-15 01:35:01,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630236163] [2023-02-15 01:35:01,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:01,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 01:35:01,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:01,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 01:35:01,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2023-02-15 01:35:01,031 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 01:35:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:01,414 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2023-02-15 01:35:01,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:35:01,415 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2023-02-15 01:35:01,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:01,416 INFO L225 Difference]: With dead ends: 124 [2023-02-15 01:35:01,416 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 01:35:01,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2023-02-15 01:35:01,416 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 261 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 375 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:01,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 302 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 474 Invalid, 0 Unknown, 375 Unchecked, 0.3s Time] [2023-02-15 01:35:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 01:35:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2023-02-15 01:35:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 68 states have (on average 1.5735294117647058) internal successors, (107), 101 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:35:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2023-02-15 01:35:01,419 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 43 [2023-02-15 01:35:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:01,420 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2023-02-15 01:35:01,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 01:35:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2023-02-15 01:35:01,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:35:01,420 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:01,424 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 01:35:01,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 01:35:01,629 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 01:35:01,629 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:35:01,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:01,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1119645598, now seen corresponding path program 1 times [2023-02-15 01:35:01,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:01,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562749601] [2023-02-15 01:35:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:01,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:01,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:01,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:01,795 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 01:35:01,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:01,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562749601] [2023-02-15 01:35:01,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562749601] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:01,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:35:01,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:35:01,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585878100] [2023-02-15 01:35:01,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:01,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:35:01,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:01,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:35:01,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:35:01,799 INFO L87 Difference]: Start difference. First operand 106 states and 113 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 01:35:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:01,966 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2023-02-15 01:35:01,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:35:01,967 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 01:35:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:01,968 INFO L225 Difference]: With dead ends: 120 [2023-02-15 01:35:01,968 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 01:35:01,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:35:01,968 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 77 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:01,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 282 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:35:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 01:35:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2023-02-15 01:35:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 97 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:35:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2023-02-15 01:35:01,971 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 46 [2023-02-15 01:35:01,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:01,971 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2023-02-15 01:35:01,972 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 01:35:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2023-02-15 01:35:01,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:35:01,972 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:01,972 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 01:35:01,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 01:35:01,972 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:35:01,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:01,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1119645597, now seen corresponding path program 1 times [2023-02-15 01:35:01,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:01,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400569048] [2023-02-15 01:35:01,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:01,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:02,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:02,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:02,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:02,237 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 01:35:02,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:02,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400569048] [2023-02-15 01:35:02,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400569048] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:02,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:35:02,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:35:02,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216576592] [2023-02-15 01:35:02,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:02,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:35:02,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:02,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:35:02,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:35:02,241 INFO L87 Difference]: Start difference. First operand 102 states and 109 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 01:35:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:02,405 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2023-02-15 01:35:02,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:35:02,405 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 01:35:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:02,406 INFO L225 Difference]: With dead ends: 98 [2023-02-15 01:35:02,406 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 01:35:02,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:35:02,407 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 76 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:02,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 293 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:35:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 01:35:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-15 01:35:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 93 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:35:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2023-02-15 01:35:02,410 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 46 [2023-02-15 01:35:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:02,410 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2023-02-15 01:35:02,410 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 01:35:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2023-02-15 01:35:02,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:35:02,411 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:02,411 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 01:35:02,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 01:35:02,411 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:35:02,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:02,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634675, now seen corresponding path program 1 times [2023-02-15 01:35:02,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:02,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136465704] [2023-02-15 01:35:02,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:02,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:02,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:02,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:03,032 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 01:35:03,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:03,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136465704] [2023-02-15 01:35:03,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136465704] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:03,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764110264] [2023-02-15 01:35:03,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:03,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:03,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:03,037 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:03,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 01:35:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:03,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 01:35:03,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:03,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:35:03,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 01:35:03,618 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2367 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2367))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-15 01:35:03,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:03,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:35:03,647 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 01:35:03,647 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 01:35:03,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 01:35:03,724 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 01:35:03,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:03,771 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_48| Int) (v_ArrVal_2373 (Array Int Int))) (or (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_48| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_48| 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_48| |c_#StackHeapBarrier|)))) is different from false [2023-02-15 01:35:03,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764110264] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:03,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:03,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-02-15 01:35:03,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230525194] [2023-02-15 01:35:03,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:03,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 01:35:03,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:03,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 01:35:03,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=573, Unknown=3, NotChecked=98, Total=756 [2023-02-15 01:35:03,774 INFO L87 Difference]: Start difference. First operand 98 states and 105 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 01:35:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:04,396 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2023-02-15 01:35:04,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 01:35:04,396 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 01:35:04,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:04,397 INFO L225 Difference]: With dead ends: 115 [2023-02-15 01:35:04,397 INFO L226 Difference]: Without dead ends: 115 [2023-02-15 01:35:04,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=952, Unknown=5, NotChecked=130, Total=1260 [2023-02-15 01:35:04,398 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 432 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:04,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 476 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 679 Invalid, 3 Unknown, 120 Unchecked, 0.4s Time] [2023-02-15 01:35:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-15 01:35:04,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2023-02-15 01:35:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 92 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 01:35:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2023-02-15 01:35:04,402 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 46 [2023-02-15 01:35:04,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:04,402 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2023-02-15 01:35:04,402 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 01:35:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2023-02-15 01:35:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:35:04,403 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:04,403 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 01:35:04,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 01:35:04,613 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 01:35:04,613 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:35:04,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:04,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634674, now seen corresponding path program 1 times [2023-02-15 01:35:04,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:04,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074000897] [2023-02-15 01:35:04,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:04,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:05,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:05,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:05,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:05,749 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 01:35:05,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:05,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074000897] [2023-02-15 01:35:05,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074000897] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:05,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8921366] [2023-02-15 01:35:05,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:05,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:05,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:05,751 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:05,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 01:35:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:05,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-15 01:35:06,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:06,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:35:06,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:35:06,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:35:06,570 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2607 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2607) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2612 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2612))) (exists ((v_ArrVal_2613 (Array Int Int))) (= |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 01:35:06,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:06,599 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 16 treesize of output 18 [2023-02-15 01:35:06,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:06,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 01:35:06,623 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:35:06,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:35:06,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:06,628 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 01:35:06,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:35:06,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 01:35:06,716 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 01:35:06,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:06,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8921366] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:06,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:06,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2023-02-15 01:35:06,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652121439] [2023-02-15 01:35:06,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:06,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 01:35:06,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:06,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 01:35:06,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=963, Unknown=2, NotChecked=62, Total=1122 [2023-02-15 01:35:06,967 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 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 01:35:08,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:08,510 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2023-02-15 01:35:08,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 01:35:08,511 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 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 01:35:08,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:08,512 INFO L225 Difference]: With dead ends: 96 [2023-02-15 01:35:08,512 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 01:35:08,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=220, Invalid=1759, Unknown=5, NotChecked=86, Total=2070 [2023-02-15 01:35:08,513 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 345 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:08,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 965 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1366 Invalid, 3 Unknown, 100 Unchecked, 0.9s Time] [2023-02-15 01:35:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 01:35:08,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-02-15 01:35:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 91 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:35:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2023-02-15 01:35:08,516 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 46 [2023-02-15 01:35:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:08,516 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2023-02-15 01:35:08,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 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 01:35:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2023-02-15 01:35:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:35:08,517 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:08,517 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 01:35:08,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 01:35:08,717 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 01:35:08,717 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:35:08,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:08,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1999401721, now seen corresponding path program 1 times [2023-02-15 01:35:08,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:08,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523208811] [2023-02-15 01:35:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:08,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:09,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:09,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:09,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:09,269 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 01:35:09,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:09,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523208811] [2023-02-15 01:35:09,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523208811] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:09,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483970817] [2023-02-15 01:35:09,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:09,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:09,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:09,271 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:09,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 01:35:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:09,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 01:35:09,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:09,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:35:09,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:35:09,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:09,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:35:09,781 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:35:09,781 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 29 treesize of output 30 [2023-02-15 01:35:09,817 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 01:35:09,861 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 01:35:09,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:35:09,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483970817] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:09,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:35:09,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 26 [2023-02-15 01:35:09,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226696551] [2023-02-15 01:35:09,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:09,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 01:35:09,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:09,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 01:35:09,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2023-02-15 01:35:09,863 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (3), 1 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 01:35:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:10,234 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2023-02-15 01:35:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 01:35:10,234 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (3), 1 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 51 [2023-02-15 01:35:10,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:10,235 INFO L225 Difference]: With dead ends: 113 [2023-02-15 01:35:10,235 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 01:35:10,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2023-02-15 01:35:10,236 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 223 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:10,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 329 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:35:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 01:35:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 93. [2023-02-15 01:35:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 88 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 01:35:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2023-02-15 01:35:10,239 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 51 [2023-02-15 01:35:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:10,239 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2023-02-15 01:35:10,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (3), 1 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 01:35:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2023-02-15 01:35:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:35:10,240 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:10,240 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 01:35:10,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 01:35:10,446 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 01:35:10,446 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:35:10,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:10,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1999401722, now seen corresponding path program 1 times [2023-02-15 01:35:10,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:10,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480082338] [2023-02-15 01:35:10,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:10,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:10,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:10,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:10,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:10,965 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 01:35:10,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:10,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480082338] [2023-02-15 01:35:10,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480082338] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:10,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310978268] [2023-02-15 01:35:10,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:10,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:10,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:10,969 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:10,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 01:35:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:11,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 01:35:11,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:11,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 01:35:11,581 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3170 (Array Int Int))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3170) |c_#memory_$Pointer$.base|) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-02-15 01:35:11,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:11,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-15 01:35:11,622 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 01:35:11,641 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 01:35:11,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:11,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310978268] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:11,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:11,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-15 01:35:11,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565952364] [2023-02-15 01:35:11,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:11,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 01:35:11,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:11,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 01:35:11,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=617, Unknown=2, NotChecked=50, Total=756 [2023-02-15 01:35:11,752 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 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 01:35:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:12,261 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2023-02-15 01:35:12,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 01:35:12,261 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 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 01:35:12,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:12,262 INFO L225 Difference]: With dead ends: 90 [2023-02-15 01:35:12,262 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 01:35:12,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=959, Unknown=2, NotChecked=64, Total=1190 [2023-02-15 01:35:12,263 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 304 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:12,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 692 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 438 Invalid, 0 Unknown, 93 Unchecked, 0.3s Time] [2023-02-15 01:35:12,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 01:35:12,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-02-15 01:35:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.3846153846153846) 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 01:35:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-02-15 01:35:12,267 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 51 [2023-02-15 01:35:12,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:12,267 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-02-15 01:35:12,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 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 01:35:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-02-15 01:35:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 01:35:12,268 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:12,268 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 01:35:12,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 01:35:12,474 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,SelfDestructingSolverStorable20 [2023-02-15 01:35:12,475 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:35:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:12,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1685641326, now seen corresponding path program 1 times [2023-02-15 01:35:12,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:12,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297160814] [2023-02-15 01:35:12,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:12,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:12,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:12,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:12,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:12,601 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 01:35:12,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:12,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297160814] [2023-02-15 01:35:12,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297160814] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:12,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:35:12,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:35:12,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707274967] [2023-02-15 01:35:12,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:12,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:35:12,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:12,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:35:12,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:35:12,603 INFO L87 Difference]: Start difference. First operand 90 states and 96 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 01:35:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:12,741 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2023-02-15 01:35:12,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:35:12,742 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 01:35:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:12,742 INFO L225 Difference]: With dead ends: 107 [2023-02-15 01:35:12,743 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 01:35:12,743 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 01:35:12,744 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 57 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:12,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 305 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:35:12,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 01:35:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2023-02-15 01:35:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.3692307692307693) 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 01:35:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-02-15 01:35:12,747 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 52 [2023-02-15 01:35:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:12,747 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-02-15 01:35:12,747 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 01:35:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-02-15 01:35:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 01:35:12,748 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:12,748 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 01:35:12,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 01:35:12,748 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:35:12,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:12,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1685641325, now seen corresponding path program 1 times [2023-02-15 01:35:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:12,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127889605] [2023-02-15 01:35:12,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:12,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:12,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:12,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:12,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:12,949 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 01:35:12,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:12,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127889605] [2023-02-15 01:35:12,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127889605] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:12,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:35:12,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:35:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400913171] [2023-02-15 01:35:12,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:12,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:35:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:12,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:35:12,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:35:12,953 INFO L87 Difference]: Start difference. First operand 89 states and 95 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 01:35:13,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:13,105 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2023-02-15 01:35:13,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:35:13,106 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 01:35:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:13,106 INFO L225 Difference]: With dead ends: 88 [2023-02-15 01:35:13,106 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 01:35:13,107 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 01:35:13,107 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 60 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:13,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 303 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:35:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 01:35:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-15 01:35:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.353846153846154) 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 01:35:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-02-15 01:35:13,110 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 52 [2023-02-15 01:35:13,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:13,110 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-02-15 01:35:13,110 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 01:35:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-02-15 01:35:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 01:35:13,111 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:13,111 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 01:35:13,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 01:35:13,111 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:35:13,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash -715273504, now seen corresponding path program 1 times [2023-02-15 01:35:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:13,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246644322] [2023-02-15 01:35:13,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:13,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:13,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:13,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:14,687 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 01:35:14,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:14,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246644322] [2023-02-15 01:35:14,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246644322] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:14,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269760556] [2023-02-15 01:35:14,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:14,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:14,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:14,693 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:14,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 01:35:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:14,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 87 conjunts are in the unsatisfiable core [2023-02-15 01:35:14,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:15,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:35:15,197 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 01:35:15,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:35:15,361 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 01:35:15,366 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 01:35:15,378 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:35:15,379 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 01:35:15,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:15,633 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 01:35:15,633 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 37 treesize of output 36 [2023-02-15 01:35:15,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:15,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-02-15 01:35:15,673 INFO L321 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2023-02-15 01:35:15,673 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 01:35:15,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-02-15 01:35:15,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:35:15,909 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 45 treesize of output 34 [2023-02-15 01:35:15,968 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 01:35:15,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:16,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269760556] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:16,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:16,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 38 [2023-02-15 01:35:16,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374764181] [2023-02-15 01:35:16,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:16,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 01:35:16,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:16,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 01:35:16,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1593, Unknown=0, NotChecked=0, Total=1722 [2023-02-15 01:35:16,183 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 39 states, 36 states have (on average 2.138888888888889) internal successors, (77), 34 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 01:35:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:17,880 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2023-02-15 01:35:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 01:35:17,880 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 2.138888888888889) internal successors, (77), 34 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 01:35:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:17,881 INFO L225 Difference]: With dead ends: 105 [2023-02-15 01:35:17,881 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 01:35:17,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=409, Invalid=3131, Unknown=0, NotChecked=0, Total=3540 [2023-02-15 01:35:17,882 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 538 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:17,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 953 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 01:35:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 01:35:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2023-02-15 01:35:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 82 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:35:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2023-02-15 01:35:17,885 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 53 [2023-02-15 01:35:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:17,885 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2023-02-15 01:35:17,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 2.138888888888889) internal successors, (77), 34 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 01:35:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2023-02-15 01:35:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 01:35:17,886 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:17,886 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 01:35:17,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 01:35:18,093 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 01:35:18,093 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:35:18,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:18,094 INFO L85 PathProgramCache]: Analyzing trace with hash -715273503, now seen corresponding path program 1 times [2023-02-15 01:35:18,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:18,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211910530] [2023-02-15 01:35:18,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:18,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:19,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:19,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:35:20,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:20,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211910530] [2023-02-15 01:35:20,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211910530] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:20,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296470645] [2023-02-15 01:35:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:20,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:20,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:20,449 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:20,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 01:35:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:20,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 96 conjunts are in the unsatisfiable core [2023-02-15 01:35:20,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:20,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:35:21,183 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 01:35:21,188 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 01:35:21,365 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 01:35:21,366 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 81 treesize of output 44 [2023-02-15 01:35:21,378 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 01:35:21,378 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 31 treesize of output 25 [2023-02-15 01:35:21,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:35:21,404 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:35:21,405 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 01:35:21,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:21,810 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:35:21,810 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 87 treesize of output 83 [2023-02-15 01:35:21,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:21,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:21,821 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 01:35:21,821 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 78 treesize of output 71 [2023-02-15 01:35:21,839 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2023-02-15 01:35:21,840 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 42 treesize of output 62 [2023-02-15 01:35:21,864 INFO L321 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2023-02-15 01:35:21,865 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 34 treesize of output 36 [2023-02-15 01:35:22,036 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 01:35:22,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 50 [2023-02-15 01:35:22,046 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 01:35:22,047 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 44 treesize of output 28 [2023-02-15 01:35:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:35:22,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:23,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296470645] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:23,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:23,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 45 [2023-02-15 01:35:23,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684202099] [2023-02-15 01:35:23,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:23,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 01:35:23,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:23,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 01:35:23,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2388, Unknown=1, NotChecked=0, Total=2550 [2023-02-15 01:35:23,910 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 46 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 40 states have internal predecessors, (93), 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 01:35:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:26,087 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2023-02-15 01:35:26,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 01:35:26,088 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 40 states have internal predecessors, (93), 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 53 [2023-02-15 01:35:26,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:26,088 INFO L225 Difference]: With dead ends: 86 [2023-02-15 01:35:26,089 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 01:35:26,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=361, Invalid=4330, Unknown=1, NotChecked=0, Total=4692 [2023-02-15 01:35:26,090 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 288 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:26,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1055 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 01:35:26,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 01:35:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-15 01:35:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.323076923076923) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:35:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2023-02-15 01:35:26,093 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 53 [2023-02-15 01:35:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:26,093 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2023-02-15 01:35:26,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 40 states have internal predecessors, (93), 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 01:35:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2023-02-15 01:35:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 01:35:26,094 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:26,094 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 01:35:26,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 01:35:26,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:26,302 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:35:26,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:26,302 INFO L85 PathProgramCache]: Analyzing trace with hash 821274968, now seen corresponding path program 1 times [2023-02-15 01:35:26,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:26,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255007078] [2023-02-15 01:35:26,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:26,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:28,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:35:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:28,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:35:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:28,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:35:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:28,570 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 01:35:28,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:28,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255007078] [2023-02-15 01:35:28,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255007078] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:28,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291711931] [2023-02-15 01:35:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:28,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:28,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:28,572 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:28,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 01:35:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:28,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 114 conjunts are in the unsatisfiable core [2023-02-15 01:35:28,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:28,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:35:28,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:35:29,007 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:35:29,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:35:29,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:35:29,348 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 01:35:29,519 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 01:35:29,520 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 35 treesize of output 16 [2023-02-15 01:35:29,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:35:29,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:29,947 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:35:29,947 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 43 treesize of output 47 [2023-02-15 01:35:29,956 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:35:29,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:35:29,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:29,966 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 27 [2023-02-15 01:35:30,652 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 47 treesize of output 35 [2023-02-15 01:35:30,662 INFO L321 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2023-02-15 01:35:30,663 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 63 treesize of output 39 [2023-02-15 01:35:30,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:30,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:30,775 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 01:35:30,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:30,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 01:35:30,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:30,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 01:35:30,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:30,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:30,827 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:35:30,827 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 1 case distinctions, treesize of input 23 treesize of output 32 [2023-02-15 01:35:30,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:35:30,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 01:35:30,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:35:31,005 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:35:31,006 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 45 treesize of output 44 [2023-02-15 01:35:31,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:31,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 01:35:31,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-02-15 01:35:31,081 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 01:35:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:35:31,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:31,343 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4389 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4389) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4388 (Array Int Int)) (v_ArrVal_4389 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4389) |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_4388) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 01:36:42,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:36:42,206 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 203 treesize of output 207 [2023-02-15 01:36:43,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291711931] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:43,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:36:43,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 64 [2023-02-15 01:36:43,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665349980] [2023-02-15 01:36:43,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:36:43,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-02-15 01:36:43,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:43,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-02-15 01:36:43,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=5731, Unknown=184, NotChecked=154, Total=6320 [2023-02-15 01:36:43,301 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 65 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 56 states have internal predecessors, (103), 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 01:36:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:57,944 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2023-02-15 01:36:57,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 01:36:57,945 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 56 states have internal predecessors, (103), 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 58 [2023-02-15 01:36:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:57,945 INFO L225 Difference]: With dead ends: 104 [2023-02-15 01:36:57,945 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 01:36:57,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2584 ImplicationChecksByTransitivity, 83.5s TimeCoverageRelationStatistics Valid=714, Invalid=10233, Unknown=187, NotChecked=208, Total=11342 [2023-02-15 01:36:57,948 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 970 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 2253 mSolverCounterSat, 61 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 2317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2253 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:36:57,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1019 Invalid, 2317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2253 Invalid, 3 Unknown, 0 Unchecked, 4.5s Time] [2023-02-15 01:36:57,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 01:36:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2023-02-15 01:36:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 79 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 01:36:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-02-15 01:36:57,951 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 58 [2023-02-15 01:36:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:57,951 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-02-15 01:36:57,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 56 states have internal predecessors, (103), 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 01:36:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-02-15 01:36:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 01:36:57,952 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:57,953 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 01:36:57,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-02-15 01:36:58,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-15 01:36:58,159 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 01:36:58,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:58,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1028736951, now seen corresponding path program 1 times [2023-02-15 01:36:58,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:58,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618917823] [2023-02-15 01:36:58,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:58,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:03,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:03,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 01:37:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:04,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 01:37:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:37:06,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:06,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618917823] [2023-02-15 01:37:06,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618917823] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:06,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553781337] [2023-02-15 01:37:06,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:06,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:06,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:37:06,966 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:37:06,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 01:37:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:07,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 136 conjunts are in the unsatisfiable core [2023-02-15 01:37:07,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:37:07,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:37:07,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:37:07,874 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:37:07,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:37:08,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:37:09,439 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 01:37:10,159 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 01:37:10,159 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 54 treesize of output 21 [2023-02-15 01:37:10,175 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:37:10,176 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 01:37:11,116 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 01:37:11,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:11,704 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:37:11,704 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 62 treesize of output 60 [2023-02-15 01:37:11,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:11,719 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 44 treesize of output 44 [2023-02-15 01:37:11,771 INFO L321 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2023-02-15 01:37:11,772 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 3 case distinctions, treesize of input 34 treesize of output 36 [2023-02-15 01:37:14,243 INFO L321 Elim1Store]: treesize reduction 61, result has 17.6 percent of original size [2023-02-15 01:37:14,244 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 89 treesize of output 47 [2023-02-15 01:37:14,261 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 53 treesize of output 37 [2023-02-15 01:37:14,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:14,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:37:14,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:14,598 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 21 treesize of output 20 [2023-02-15 01:37:14,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:14,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:14,620 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 43 treesize of output 44 [2023-02-15 01:37:14,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:14,652 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 01:37:14,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:14,960 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 43 treesize of output 39 [2023-02-15 01:37:14,965 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 24 treesize of output 12 [2023-02-15 01:37:14,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:14,985 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 01:37:14,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:37:15,333 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 01:37:15,343 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 01:37:15,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:37:15,704 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:37:15,704 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 68 treesize of output 63 [2023-02-15 01:37:15,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:15,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2023-02-15 01:37:15,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:15,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 01:37:16,080 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 30 treesize of output 18 [2023-02-15 01:37:16,089 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 22 treesize of output 10 [2023-02-15 01:37:16,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:37:16,378 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:37:16,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:37:20,403 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4719 (Array Int Int)) (v_ArrVal_4721 Int) (v_ArrVal_4722 (Array Int Int)) (v_ArrVal_4713 (Array Int Int)) (v_ArrVal_4714 (Array Int Int)) (v_ArrVal_4715 (Array Int Int)) (v_ArrVal_4716 (Array Int Int)) (v_ArrVal_4717 (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_4714) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4718))) (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_4721))) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4713) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4717) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4722) |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_4715) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4716) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4719) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2023-02-15 01:37:25,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:37:25,086 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 279 treesize of output 250 [2023-02-15 01:37:25,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:37:25,182 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 544452 treesize of output 539470 [2023-02-15 01:37:25,619 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 623874 treesize of output 563458 [2023-02-15 01:37:26,044 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 605698 treesize of output 546306 [2023-02-15 01:37:26,438 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 612898 treesize of output 592674