./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 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/memsafety-ext/tree_cnstr.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 ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:21:12,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:21:12,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:21:12,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:21:12,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:21:12,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:21:12,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:21:12,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:21:12,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:21:12,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:21:12,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:21:12,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:21:12,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:21:12,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:21:12,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:21:12,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:21:12,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:21:12,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:21:12,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:21:12,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:21:12,404 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:21:12,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:21:12,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:21:12,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:21:12,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:21:12,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:21:12,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:21:12,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:21:12,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:21:12,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:21:12,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:21:12,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:21:12,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:21:12,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:21:12,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:21:12,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:21:12,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:21:12,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:21:12,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:21:12,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:21:12,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:21:12,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:21:12,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:21:12,434 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:21:12,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:21:12,435 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:21:12,435 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:21:12,435 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:21:12,436 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:21:12,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:21:12,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:21:12,436 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:21:12,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:21:12,437 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:21:12,437 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:21:12,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:21:12,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:21:12,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:21:12,437 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:21:12,438 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:21:12,438 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:21:12,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:21:12,438 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:21:12,438 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:21:12,438 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:21:12,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:21:12,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:21:12,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:21:12,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:21:12,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:21:12,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:21:12,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:21:12,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:21:12,440 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d [2022-07-14 06:21:12,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:21:12,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:21:12,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:21:12,633 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:21:12,633 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:21:12,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2022-07-14 06:21:12,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5acc4ef0/7c821b6d6173428999edcaf6b08037e0/FLAGc6d2899bf [2022-07-14 06:21:13,226 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:21:13,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2022-07-14 06:21:13,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5acc4ef0/7c821b6d6173428999edcaf6b08037e0/FLAGc6d2899bf [2022-07-14 06:21:13,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5acc4ef0/7c821b6d6173428999edcaf6b08037e0 [2022-07-14 06:21:13,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:21:13,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:21:13,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:21:13,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:21:13,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:21:13,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:21:13" (1/1) ... [2022-07-14 06:21:13,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6a2339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:13, skipping insertion in model container [2022-07-14 06:21:13,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:21:13" (1/1) ... [2022-07-14 06:21:13,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:21:13,606 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:21:14,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:21:14,022 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:21:14,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:21:14,142 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:21:14,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:14 WrapperNode [2022-07-14 06:21:14,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:21:14,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:21:14,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:21:14,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:21:14,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:14" (1/1) ... [2022-07-14 06:21:14,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:14" (1/1) ... [2022-07-14 06:21:14,227 INFO L137 Inliner]: procedures = 123, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2022-07-14 06:21:14,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:21:14,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:21:14,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:21:14,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:21:14,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:14" (1/1) ... [2022-07-14 06:21:14,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:14" (1/1) ... [2022-07-14 06:21:14,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:14" (1/1) ... [2022-07-14 06:21:14,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:14" (1/1) ... [2022-07-14 06:21:14,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:14" (1/1) ... [2022-07-14 06:21:14,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:14" (1/1) ... [2022-07-14 06:21:14,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:14" (1/1) ... [2022-07-14 06:21:14,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:21:14,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:21:14,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:21:14,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:21:14,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:14" (1/1) ... [2022-07-14 06:21:14,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:21:14,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:21:14,368 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) [2022-07-14 06:21:14,413 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 [2022-07-14 06:21:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:21:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:21:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:21:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:21:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:21:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:21:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:21:14,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:21:14,643 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:21:14,645 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:21:15,239 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:21:15,248 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:21:15,248 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-14 06:21:15,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:21:15 BoogieIcfgContainer [2022-07-14 06:21:15,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:21:15,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:21:15,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:21:15,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:21:15,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:21:13" (1/3) ... [2022-07-14 06:21:15,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52718ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:21:15, skipping insertion in model container [2022-07-14 06:21:15,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:14" (2/3) ... [2022-07-14 06:21:15,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52718ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:21:15, skipping insertion in model container [2022-07-14 06:21:15,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:21:15" (3/3) ... [2022-07-14 06:21:15,262 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_cnstr.i [2022-07-14 06:21:15,272 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:21:15,273 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2022-07-14 06:21:15,346 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:21:15,357 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@423db043, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@51234b23 [2022-07-14 06:21:15,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2022-07-14 06:21:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 66 states have (on average 2.121212121212121) internal successors, (140), 122 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:21:15,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:15,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:21:15,370 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:15,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:15,378 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 06:21:15,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:15,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578117577] [2022-07-14 06:21:15,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:15,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:15,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:15,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578117577] [2022-07-14 06:21:15,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578117577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:15,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:15,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:21:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458878215] [2022-07-14 06:21:15,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:15,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:21:15,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:15,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:21:15,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:15,694 INFO L87 Difference]: Start difference. First operand has 123 states, 66 states have (on average 2.121212121212121) internal successors, (140), 122 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:15,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:15,909 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2022-07-14 06:21:15,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:21:15,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:21:15,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:15,932 INFO L225 Difference]: With dead ends: 166 [2022-07-14 06:21:15,932 INFO L226 Difference]: Without dead ends: 162 [2022-07-14 06:21:15,933 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 [2022-07-14 06:21:15,947 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 128 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:15,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 106 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:21:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-14 06:21:15,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 119. [2022-07-14 06:21:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 2.0307692307692307) internal successors, (132), 118 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2022-07-14 06:21:16,010 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 3 [2022-07-14 06:21:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:16,010 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2022-07-14 06:21:16,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:16,011 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-07-14 06:21:16,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:21:16,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:16,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:21:16,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:21:16,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:16,012 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 06:21:16,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:16,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275874463] [2022-07-14 06:21:16,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:16,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:16,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:16,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275874463] [2022-07-14 06:21:16,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275874463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:16,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:16,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:21:16,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511045002] [2022-07-14 06:21:16,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:16,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:21:16,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:16,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:21:16,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:16,131 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:16,263 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2022-07-14 06:21:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:21:16,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:21:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:16,266 INFO L225 Difference]: With dead ends: 160 [2022-07-14 06:21:16,267 INFO L226 Difference]: Without dead ends: 160 [2022-07-14 06:21:16,269 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 [2022-07-14 06:21:16,271 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 125 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:16,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 110 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:21:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-14 06:21:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2022-07-14 06:21:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 65 states have (on average 2.0) internal successors, (130), 116 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2022-07-14 06:21:16,289 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 3 [2022-07-14 06:21:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:16,290 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2022-07-14 06:21:16,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2022-07-14 06:21:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:21:16,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:16,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:16,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:21:16,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:16,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:16,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031021, now seen corresponding path program 1 times [2022-07-14 06:21:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:16,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549484086] [2022-07-14 06:21:16,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:16,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:16,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:16,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549484086] [2022-07-14 06:21:16,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549484086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:16,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:16,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:21:16,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12760329] [2022-07-14 06:21:16,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:16,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:21:16,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:16,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:21:16,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:21:16,354 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:16,544 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2022-07-14 06:21:16,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:21:16,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:21:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:16,546 INFO L225 Difference]: With dead ends: 146 [2022-07-14 06:21:16,546 INFO L226 Difference]: Without dead ends: 146 [2022-07-14 06:21:16,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:16,547 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 233 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:16,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 75 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:21:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-14 06:21:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2022-07-14 06:21:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.7647058823529411) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2022-07-14 06:21:16,551 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 7 [2022-07-14 06:21:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:16,551 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2022-07-14 06:21:16,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2022-07-14 06:21:16,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:21:16,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:16,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:16,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:21:16,553 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:16,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:16,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031022, now seen corresponding path program 1 times [2022-07-14 06:21:16,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:16,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554573418] [2022-07-14 06:21:16,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:16,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:16,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:16,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554573418] [2022-07-14 06:21:16,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554573418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:16,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:16,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:21:16,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275745960] [2022-07-14 06:21:16,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:16,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:21:16,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:16,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:21:16,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:21:16,597 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:16,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:16,830 INFO L93 Difference]: Finished difference Result 227 states and 259 transitions. [2022-07-14 06:21:16,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:21:16,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:21:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:16,832 INFO L225 Difference]: With dead ends: 227 [2022-07-14 06:21:16,832 INFO L226 Difference]: Without dead ends: 227 [2022-07-14 06:21:16,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:16,839 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 267 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:16,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 124 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:21:16,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-14 06:21:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 172. [2022-07-14 06:21:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6985294117647058) internal successors, (231), 171 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 231 transitions. [2022-07-14 06:21:16,874 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 231 transitions. Word has length 7 [2022-07-14 06:21:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:16,874 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 231 transitions. [2022-07-14 06:21:16,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 231 transitions. [2022-07-14 06:21:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:21:16,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:16,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:16,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:21:16,876 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:16,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1237592114, now seen corresponding path program 1 times [2022-07-14 06:21:16,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:16,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804495630] [2022-07-14 06:21:16,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:16,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:16,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:16,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804495630] [2022-07-14 06:21:16,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804495630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:16,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:16,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:21:16,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785329417] [2022-07-14 06:21:16,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:16,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:21:16,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:16,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:21:16,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:16,943 INFO L87 Difference]: Start difference. First operand 172 states and 231 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:16,953 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2022-07-14 06:21:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:21:16,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-14 06:21:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:16,954 INFO L225 Difference]: With dead ends: 186 [2022-07-14 06:21:16,954 INFO L226 Difference]: Without dead ends: 186 [2022-07-14 06:21:16,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:16,955 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 103 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 156 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 [2022-07-14 06:21:16,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 156 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:21:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-14 06:21:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2022-07-14 06:21:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6838235294117647) internal successors, (229), 171 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 229 transitions. [2022-07-14 06:21:16,967 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 229 transitions. Word has length 10 [2022-07-14 06:21:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:16,967 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 229 transitions. [2022-07-14 06:21:16,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:16,968 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2022-07-14 06:21:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:21:16,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:16,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:16,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:21:16,971 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:16,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:16,971 INFO L85 PathProgramCache]: Analyzing trace with hash -288934911, now seen corresponding path program 1 times [2022-07-14 06:21:16,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:16,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563945866] [2022-07-14 06:21:16,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:16,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:17,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:17,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563945866] [2022-07-14 06:21:17,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563945866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:17,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:17,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:21:17,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761600989] [2022-07-14 06:21:17,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:17,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:21:17,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:21:17,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:17,058 INFO L87 Difference]: Start difference. First operand 172 states and 229 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:17,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:17,065 INFO L93 Difference]: Finished difference Result 175 states and 232 transitions. [2022-07-14 06:21:17,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:21:17,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-14 06:21:17,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:17,080 INFO L225 Difference]: With dead ends: 175 [2022-07-14 06:21:17,080 INFO L226 Difference]: Without dead ends: 175 [2022-07-14 06:21:17,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:17,081 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 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 [2022-07-14 06:21:17,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:21:17,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-14 06:21:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-07-14 06:21:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 139 states have (on average 1.669064748201439) internal successors, (232), 174 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 232 transitions. [2022-07-14 06:21:17,089 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 232 transitions. Word has length 14 [2022-07-14 06:21:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:17,089 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 232 transitions. [2022-07-14 06:21:17,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 232 transitions. [2022-07-14 06:21:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:21:17,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:17,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:17,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:21:17,090 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:17,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1836248265, now seen corresponding path program 1 times [2022-07-14 06:21:17,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:17,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610912473] [2022-07-14 06:21:17,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:17,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:17,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:17,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610912473] [2022-07-14 06:21:17,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610912473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:17,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:17,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:21:17,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392637068] [2022-07-14 06:21:17,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:17,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:21:17,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:17,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:21:17,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:17,176 INFO L87 Difference]: Start difference. First operand 175 states and 232 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:17,182 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2022-07-14 06:21:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:21:17,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-14 06:21:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:17,183 INFO L225 Difference]: With dead ends: 177 [2022-07-14 06:21:17,184 INFO L226 Difference]: Without dead ends: 177 [2022-07-14 06:21:17,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:17,186 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 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 [2022-07-14 06:21:17,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:21:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-14 06:21:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-07-14 06:21:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 141 states have (on average 1.6595744680851063) internal successors, (234), 176 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2022-07-14 06:21:17,191 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 14 [2022-07-14 06:21:17,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:17,191 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2022-07-14 06:21:17,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2022-07-14 06:21:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:21:17,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:17,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:17,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:21:17,199 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:17,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:17,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1556334460, now seen corresponding path program 1 times [2022-07-14 06:21:17,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:17,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105758379] [2022-07-14 06:21:17,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:17,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:17,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:17,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105758379] [2022-07-14 06:21:17,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105758379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:17,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:17,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:21:17,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539384578] [2022-07-14 06:21:17,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:17,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:21:17,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:17,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:21:17,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:17,277 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:17,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:17,305 INFO L93 Difference]: Finished difference Result 192 states and 243 transitions. [2022-07-14 06:21:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:21:17,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:21:17,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:17,306 INFO L225 Difference]: With dead ends: 192 [2022-07-14 06:21:17,306 INFO L226 Difference]: Without dead ends: 192 [2022-07-14 06:21:17,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:17,307 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:17,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 216 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:21:17,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-14 06:21:17,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2022-07-14 06:21:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 143 states have (on average 1.6293706293706294) internal successors, (233), 178 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 233 transitions. [2022-07-14 06:21:17,312 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 233 transitions. Word has length 16 [2022-07-14 06:21:17,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:17,313 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 233 transitions. [2022-07-14 06:21:17,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:17,313 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 233 transitions. [2022-07-14 06:21:17,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:21:17,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:17,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:17,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:21:17,316 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:17,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:17,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1356387674, now seen corresponding path program 1 times [2022-07-14 06:21:17,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:17,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87846655] [2022-07-14 06:21:17,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:17,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:17,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:17,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87846655] [2022-07-14 06:21:17,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87846655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:17,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:17,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:21:17,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721546216] [2022-07-14 06:21:17,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:17,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:21:17,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:17,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:21:17,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:21:17,485 INFO L87 Difference]: Start difference. First operand 179 states and 233 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:17,956 INFO L93 Difference]: Finished difference Result 274 states and 343 transitions. [2022-07-14 06:21:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:21:17,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:21:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:17,958 INFO L225 Difference]: With dead ends: 274 [2022-07-14 06:21:17,958 INFO L226 Difference]: Without dead ends: 274 [2022-07-14 06:21:17,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:21:17,958 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 123 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:17,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 413 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:21:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-07-14 06:21:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 193. [2022-07-14 06:21:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 157 states have (on average 1.605095541401274) internal successors, (252), 192 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 252 transitions. [2022-07-14 06:21:17,962 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 252 transitions. Word has length 16 [2022-07-14 06:21:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:17,962 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 252 transitions. [2022-07-14 06:21:17,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 252 transitions. [2022-07-14 06:21:17,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:21:17,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:17,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:17,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:21:17,963 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:17,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:17,964 INFO L85 PathProgramCache]: Analyzing trace with hash -508929720, now seen corresponding path program 1 times [2022-07-14 06:21:17,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:17,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756722151] [2022-07-14 06:21:17,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:17,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:18,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:18,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756722151] [2022-07-14 06:21:18,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756722151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:18,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:18,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:21:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528210629] [2022-07-14 06:21:18,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:18,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:21:18,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:18,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:21:18,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:21:18,013 INFO L87 Difference]: Start difference. First operand 193 states and 252 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:18,199 INFO L93 Difference]: Finished difference Result 273 states and 341 transitions. [2022-07-14 06:21:18,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:21:18,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-14 06:21:18,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:18,202 INFO L225 Difference]: With dead ends: 273 [2022-07-14 06:21:18,202 INFO L226 Difference]: Without dead ends: 273 [2022-07-14 06:21:18,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:21:18,203 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 126 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:18,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 417 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:21:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-14 06:21:18,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 228. [2022-07-14 06:21:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 192 states have (on average 1.609375) internal successors, (309), 227 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 309 transitions. [2022-07-14 06:21:18,208 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 309 transitions. Word has length 17 [2022-07-14 06:21:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:18,208 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 309 transitions. [2022-07-14 06:21:18,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 309 transitions. [2022-07-14 06:21:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:21:18,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:18,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:18,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:21:18,210 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:18,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:18,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1001745105, now seen corresponding path program 1 times [2022-07-14 06:21:18,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:18,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467991166] [2022-07-14 06:21:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:18,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:18,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467991166] [2022-07-14 06:21:18,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467991166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:18,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:18,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:21:18,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678665944] [2022-07-14 06:21:18,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:18,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:21:18,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:18,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:21:18,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:21:18,293 INFO L87 Difference]: Start difference. First operand 228 states and 309 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:18,409 INFO L93 Difference]: Finished difference Result 266 states and 328 transitions. [2022-07-14 06:21:18,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:21:18,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-14 06:21:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:18,410 INFO L225 Difference]: With dead ends: 266 [2022-07-14 06:21:18,411 INFO L226 Difference]: Without dead ends: 266 [2022-07-14 06:21:18,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:18,411 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 230 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:18,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 190 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:21:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-14 06:21:18,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 229. [2022-07-14 06:21:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 228 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 310 transitions. [2022-07-14 06:21:18,416 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 310 transitions. Word has length 17 [2022-07-14 06:21:18,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:18,417 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 310 transitions. [2022-07-14 06:21:18,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 310 transitions. [2022-07-14 06:21:18,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:21:18,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:18,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:18,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:21:18,418 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:18,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:18,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793954, now seen corresponding path program 1 times [2022-07-14 06:21:18,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:18,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711412625] [2022-07-14 06:21:18,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:18,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:18,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:18,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711412625] [2022-07-14 06:21:18,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711412625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:18,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:18,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:21:18,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638029598] [2022-07-14 06:21:18,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:18,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:21:18,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:18,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:21:18,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:18,479 INFO L87 Difference]: Start difference. First operand 229 states and 310 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:18,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:18,612 INFO L93 Difference]: Finished difference Result 228 states and 308 transitions. [2022-07-14 06:21:18,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:21:18,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:21:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:18,613 INFO L225 Difference]: With dead ends: 228 [2022-07-14 06:21:18,613 INFO L226 Difference]: Without dead ends: 228 [2022-07-14 06:21:18,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:21:18,614 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 6 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:18,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 287 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:21:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-14 06:21:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-07-14 06:21:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 193 states have (on average 1.5958549222797926) internal successors, (308), 227 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 308 transitions. [2022-07-14 06:21:18,619 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 308 transitions. Word has length 18 [2022-07-14 06:21:18,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:18,621 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 308 transitions. [2022-07-14 06:21:18,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2022-07-14 06:21:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:21:18,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:18,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:18,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 06:21:18,623 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:18,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793955, now seen corresponding path program 1 times [2022-07-14 06:21:18,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:18,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466296765] [2022-07-14 06:21:18,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:18,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:18,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:18,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466296765] [2022-07-14 06:21:18,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466296765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:18,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:18,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:21:18,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179218889] [2022-07-14 06:21:18,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:18,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:21:18,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:18,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:21:18,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:18,701 INFO L87 Difference]: Start difference. First operand 228 states and 308 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:18,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:18,893 INFO L93 Difference]: Finished difference Result 227 states and 306 transitions. [2022-07-14 06:21:18,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:21:18,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:21:18,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:18,894 INFO L225 Difference]: With dead ends: 227 [2022-07-14 06:21:18,895 INFO L226 Difference]: Without dead ends: 227 [2022-07-14 06:21:18,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:21:18,895 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:18,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 264 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:21:18,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-14 06:21:18,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2022-07-14 06:21:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 193 states have (on average 1.5854922279792747) internal successors, (306), 226 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2022-07-14 06:21:18,899 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 18 [2022-07-14 06:21:18,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:18,899 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2022-07-14 06:21:18,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2022-07-14 06:21:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:21:18,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:18,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:18,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 06:21:18,901 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:18,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:18,901 INFO L85 PathProgramCache]: Analyzing trace with hash 624480237, now seen corresponding path program 1 times [2022-07-14 06:21:18,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:18,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030945041] [2022-07-14 06:21:18,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:18,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:18,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:18,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030945041] [2022-07-14 06:21:18,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030945041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:18,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:18,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:21:18,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7700072] [2022-07-14 06:21:18,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:18,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:21:18,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:18,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:21:18,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:21:18,996 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:19,129 INFO L93 Difference]: Finished difference Result 243 states and 325 transitions. [2022-07-14 06:21:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:21:19,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-14 06:21:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:19,130 INFO L225 Difference]: With dead ends: 243 [2022-07-14 06:21:19,130 INFO L226 Difference]: Without dead ends: 243 [2022-07-14 06:21:19,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:21:19,131 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 35 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:19,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 301 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:21:19,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-14 06:21:19,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 234. [2022-07-14 06:21:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 200 states have (on average 1.575) internal successors, (315), 233 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 315 transitions. [2022-07-14 06:21:19,135 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 315 transitions. Word has length 19 [2022-07-14 06:21:19,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:19,135 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 315 transitions. [2022-07-14 06:21:19,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:19,135 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 315 transitions. [2022-07-14 06:21:19,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:21:19,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:19,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:19,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 06:21:19,136 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:19,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:19,137 INFO L85 PathProgramCache]: Analyzing trace with hash 624664935, now seen corresponding path program 1 times [2022-07-14 06:21:19,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:19,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568690656] [2022-07-14 06:21:19,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:19,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:19,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:19,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568690656] [2022-07-14 06:21:19,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568690656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:19,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:19,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:21:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416966280] [2022-07-14 06:21:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:19,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:21:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:19,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:21:19,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:21:19,179 INFO L87 Difference]: Start difference. First operand 234 states and 315 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:19,409 INFO L93 Difference]: Finished difference Result 236 states and 299 transitions. [2022-07-14 06:21:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:21:19,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-14 06:21:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:19,410 INFO L225 Difference]: With dead ends: 236 [2022-07-14 06:21:19,410 INFO L226 Difference]: Without dead ends: 236 [2022-07-14 06:21:19,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:21:19,411 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 66 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:19,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 415 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:21:19,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-14 06:21:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 206. [2022-07-14 06:21:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 172 states have (on average 1.5406976744186047) internal successors, (265), 205 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 265 transitions. [2022-07-14 06:21:19,414 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 265 transitions. Word has length 19 [2022-07-14 06:21:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:19,414 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 265 transitions. [2022-07-14 06:21:19,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:19,414 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 265 transitions. [2022-07-14 06:21:19,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:21:19,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:19,415 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:19,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 06:21:19,415 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:19,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:19,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1555885541, now seen corresponding path program 1 times [2022-07-14 06:21:19,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:19,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579450726] [2022-07-14 06:21:19,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:19,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:19,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:19,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579450726] [2022-07-14 06:21:19,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579450726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:19,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:19,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:21:19,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870238348] [2022-07-14 06:21:19,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:19,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:21:19,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:19,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:21:19,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:19,459 INFO L87 Difference]: Start difference. First operand 206 states and 265 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:19,466 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2022-07-14 06:21:19,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:21:19,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 06:21:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:19,467 INFO L225 Difference]: With dead ends: 181 [2022-07-14 06:21:19,467 INFO L226 Difference]: Without dead ends: 181 [2022-07-14 06:21:19,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:19,468 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:19,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 214 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:21:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-14 06:21:19,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2022-07-14 06:21:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 145 states have (on average 1.4758620689655173) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 214 transitions. [2022-07-14 06:21:19,472 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 214 transitions. Word has length 20 [2022-07-14 06:21:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:19,473 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 214 transitions. [2022-07-14 06:21:19,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 214 transitions. [2022-07-14 06:21:19,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:21:19,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:19,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:19,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 06:21:19,476 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash 987811916, now seen corresponding path program 1 times [2022-07-14 06:21:19,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:19,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498495447] [2022-07-14 06:21:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:19,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:19,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:19,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498495447] [2022-07-14 06:21:19,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498495447] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:21:19,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232101114] [2022-07-14 06:21:19,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:19,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:21:19,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:21:19,552 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) [2022-07-14 06:21:19,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 06:21:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:19,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:21:19,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:19,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-07-14 06:21:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:20,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:21:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:20,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232101114] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:21:20,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:21:20,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-14 06:21:20,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639345091] [2022-07-14 06:21:20,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:21:20,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:21:20,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:20,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:21:20,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:21:20,133 INFO L87 Difference]: Start difference. First operand 179 states and 214 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:20,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:20,263 INFO L93 Difference]: Finished difference Result 189 states and 224 transitions. [2022-07-14 06:21:20,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:21:20,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:21:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:20,264 INFO L225 Difference]: With dead ends: 189 [2022-07-14 06:21:20,264 INFO L226 Difference]: Without dead ends: 173 [2022-07-14 06:21:20,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:21:20,265 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 40 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:20,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 356 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2022-07-14 06:21:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-14 06:21:20,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-07-14 06:21:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 137 states have (on average 1.4963503649635037) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2022-07-14 06:21:20,269 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 21 [2022-07-14 06:21:20,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:20,269 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2022-07-14 06:21:20,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2022-07-14 06:21:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:21:20,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:20,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:20,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:20,492 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,SelfDestructingSolverStorable16 [2022-07-14 06:21:20,493 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:20,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:20,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983029, now seen corresponding path program 1 times [2022-07-14 06:21:20,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:20,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807185205] [2022-07-14 06:21:20,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:20,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:20,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:20,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807185205] [2022-07-14 06:21:20,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807185205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:20,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:20,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:21:20,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242085745] [2022-07-14 06:21:20,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:20,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:21:20,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:20,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:21:20,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:21:20,588 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:20,984 INFO L93 Difference]: Finished difference Result 172 states and 205 transitions. [2022-07-14 06:21:20,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:21:20,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:21:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:20,985 INFO L225 Difference]: With dead ends: 172 [2022-07-14 06:21:20,985 INFO L226 Difference]: Without dead ends: 172 [2022-07-14 06:21:20,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:21:20,986 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 95 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:20,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 199 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:21:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-14 06:21:20,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2022-07-14 06:21:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.4817518248175183) internal successors, (203), 169 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2022-07-14 06:21:20,989 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 21 [2022-07-14 06:21:20,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:20,989 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2022-07-14 06:21:20,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2022-07-14 06:21:20,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:21:20,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:20,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:20,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 06:21:20,990 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:20,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:20,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983030, now seen corresponding path program 1 times [2022-07-14 06:21:20,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:20,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942346825] [2022-07-14 06:21:20,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:21,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:21,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942346825] [2022-07-14 06:21:21,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942346825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:21,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:21,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:21:21,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892076245] [2022-07-14 06:21:21,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:21,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:21:21,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:21,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:21:21,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:21:21,089 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:21,567 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2022-07-14 06:21:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:21:21,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:21:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:21,569 INFO L225 Difference]: With dead ends: 171 [2022-07-14 06:21:21,569 INFO L226 Difference]: Without dead ends: 171 [2022-07-14 06:21:21,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:21:21,569 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 87 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:21,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 257 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:21:21,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-14 06:21:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2022-07-14 06:21:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.467153284671533) internal successors, (201), 168 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 201 transitions. [2022-07-14 06:21:21,572 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 201 transitions. Word has length 21 [2022-07-14 06:21:21,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:21,572 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 201 transitions. [2022-07-14 06:21:21,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:21,572 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 201 transitions. [2022-07-14 06:21:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:21:21,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:21,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:21,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 06:21:21,572 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:21,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:21,573 INFO L85 PathProgramCache]: Analyzing trace with hash 27790463, now seen corresponding path program 1 times [2022-07-14 06:21:21,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:21,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803593073] [2022-07-14 06:21:21,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:21,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:21,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:21,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803593073] [2022-07-14 06:21:21,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803593073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:21,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:21,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:21:21,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537838160] [2022-07-14 06:21:21,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:21,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:21:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:21,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:21:21,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:21,626 INFO L87 Difference]: Start difference. First operand 169 states and 201 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:21,832 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2022-07-14 06:21:21,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:21:21,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:21:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:21,833 INFO L225 Difference]: With dead ends: 168 [2022-07-14 06:21:21,833 INFO L226 Difference]: Without dead ends: 168 [2022-07-14 06:21:21,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:21:21,833 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:21,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 277 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:21:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-14 06:21:21,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-14 06:21:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 137 states have (on average 1.4525547445255473) internal successors, (199), 167 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2022-07-14 06:21:21,836 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 22 [2022-07-14 06:21:21,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:21,836 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2022-07-14 06:21:21,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2022-07-14 06:21:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:21:21,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:21,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:21,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 06:21:21,837 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:21,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash 27790464, now seen corresponding path program 1 times [2022-07-14 06:21:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:21,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466991127] [2022-07-14 06:21:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:21,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:21,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:21,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466991127] [2022-07-14 06:21:21,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466991127] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:21,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:21,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:21:21,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634468825] [2022-07-14 06:21:21,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:21,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:21:21,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:21,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:21:21,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:21,884 INFO L87 Difference]: Start difference. First operand 168 states and 199 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:22,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:22,006 INFO L93 Difference]: Finished difference Result 167 states and 197 transitions. [2022-07-14 06:21:22,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:21:22,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:21:22,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:22,007 INFO L225 Difference]: With dead ends: 167 [2022-07-14 06:21:22,007 INFO L226 Difference]: Without dead ends: 167 [2022-07-14 06:21:22,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:21:22,008 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 4 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:22,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 254 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:21:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-14 06:21:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-07-14 06:21:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 137 states have (on average 1.437956204379562) internal successors, (197), 166 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 197 transitions. [2022-07-14 06:21:22,011 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 197 transitions. Word has length 22 [2022-07-14 06:21:22,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:22,011 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 197 transitions. [2022-07-14 06:21:22,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:22,011 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 197 transitions. [2022-07-14 06:21:22,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:21:22,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:22,012 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 06:21:22,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 06:21:22,012 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:22,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919462, now seen corresponding path program 1 times [2022-07-14 06:21:22,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:22,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967048379] [2022-07-14 06:21:22,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:22,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:22,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:22,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967048379] [2022-07-14 06:21:22,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967048379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:22,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:22,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:21:22,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018356190] [2022-07-14 06:21:22,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:22,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:21:22,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:22,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:21:22,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:21:22,074 INFO L87 Difference]: Start difference. First operand 167 states and 197 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:22,308 INFO L93 Difference]: Finished difference Result 168 states and 198 transitions. [2022-07-14 06:21:22,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:21:22,310 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-14 06:21:22,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:22,310 INFO L225 Difference]: With dead ends: 168 [2022-07-14 06:21:22,310 INFO L226 Difference]: Without dead ends: 168 [2022-07-14 06:21:22,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:21:22,311 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 82 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:22,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 265 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:21:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-14 06:21:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2022-07-14 06:21:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.4306569343065694) internal successors, (196), 165 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 196 transitions. [2022-07-14 06:21:22,314 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 196 transitions. Word has length 25 [2022-07-14 06:21:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:22,314 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 196 transitions. [2022-07-14 06:21:22,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 196 transitions. [2022-07-14 06:21:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:21:22,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:22,315 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 06:21:22,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 06:21:22,315 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:22,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:22,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919461, now seen corresponding path program 1 times [2022-07-14 06:21:22,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:22,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518133675] [2022-07-14 06:21:22,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:22,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:22,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:22,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518133675] [2022-07-14 06:21:22,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518133675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:22,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:22,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:21:22,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894355984] [2022-07-14 06:21:22,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:22,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:21:22,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:22,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:21:22,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:21:22,446 INFO L87 Difference]: Start difference. First operand 166 states and 196 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:22,640 INFO L93 Difference]: Finished difference Result 167 states and 197 transitions. [2022-07-14 06:21:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:21:22,640 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-14 06:21:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:22,641 INFO L225 Difference]: With dead ends: 167 [2022-07-14 06:21:22,641 INFO L226 Difference]: Without dead ends: 167 [2022-07-14 06:21:22,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:21:22,642 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 83 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:22,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 185 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:21:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-14 06:21:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-07-14 06:21:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 137 states have (on average 1.4233576642335766) internal successors, (195), 164 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 195 transitions. [2022-07-14 06:21:22,644 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 195 transitions. Word has length 25 [2022-07-14 06:21:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:22,644 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 195 transitions. [2022-07-14 06:21:22,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 195 transitions. [2022-07-14 06:21:22,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 06:21:22,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:22,645 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:22,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 06:21:22,645 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:22,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:22,645 INFO L85 PathProgramCache]: Analyzing trace with hash -756843594, now seen corresponding path program 1 times [2022-07-14 06:21:22,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:22,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400663887] [2022-07-14 06:21:22,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:22,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:22,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:22,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400663887] [2022-07-14 06:21:22,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400663887] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:21:22,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577101916] [2022-07-14 06:21:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:22,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:21:22,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:21:22,766 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) [2022-07-14 06:21:22,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 06:21:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:22,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 06:21:22,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:23,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:23,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:23,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:21:23,322 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-14 06:21:23,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 25 [2022-07-14 06:21:23,329 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-14 06:21:23,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-07-14 06:21:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:23,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577101916] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:21:23,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:21:23,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 23 [2022-07-14 06:21:23,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923668421] [2022-07-14 06:21:23,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:21:23,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 06:21:23,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:23,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 06:21:23,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:21:23,572 INFO L87 Difference]: Start difference. First operand 165 states and 195 transitions. Second operand has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:23,997 INFO L93 Difference]: Finished difference Result 355 states and 418 transitions. [2022-07-14 06:21:23,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:21:23,997 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-14 06:21:23,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:23,998 INFO L225 Difference]: With dead ends: 355 [2022-07-14 06:21:23,998 INFO L226 Difference]: Without dead ends: 355 [2022-07-14 06:21:23,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=756, Unknown=0, NotChecked=0, Total=992 [2022-07-14 06:21:23,999 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 609 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:23,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 705 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 410 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2022-07-14 06:21:24,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-07-14 06:21:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 236. [2022-07-14 06:21:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 208 states have (on average 1.3509615384615385) internal successors, (281), 235 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 281 transitions. [2022-07-14 06:21:24,002 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 281 transitions. Word has length 38 [2022-07-14 06:21:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:24,003 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 281 transitions. [2022-07-14 06:21:24,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 281 transitions. [2022-07-14 06:21:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 06:21:24,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:24,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:24,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:24,215 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,SelfDestructingSolverStorable23 [2022-07-14 06:21:24,215 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:24,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1767960844, now seen corresponding path program 1 times [2022-07-14 06:21:24,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:24,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127527904] [2022-07-14 06:21:24,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:24,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:21:24,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:24,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127527904] [2022-07-14 06:21:24,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127527904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:24,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:24,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 06:21:24,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920780468] [2022-07-14 06:21:24,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:24,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:21:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:24,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:21:24,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:21:24,385 INFO L87 Difference]: Start difference. First operand 236 states and 281 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:25,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:25,003 INFO L93 Difference]: Finished difference Result 338 states and 394 transitions. [2022-07-14 06:21:25,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:21:25,003 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-14 06:21:25,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:25,004 INFO L225 Difference]: With dead ends: 338 [2022-07-14 06:21:25,004 INFO L226 Difference]: Without dead ends: 338 [2022-07-14 06:21:25,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2022-07-14 06:21:25,005 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 246 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:25,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 630 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:21:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-14 06:21:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 222. [2022-07-14 06:21:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 194 states have (on average 1.3556701030927836) internal successors, (263), 221 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 263 transitions. [2022-07-14 06:21:25,008 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 263 transitions. Word has length 38 [2022-07-14 06:21:25,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:25,008 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 263 transitions. [2022-07-14 06:21:25,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2022-07-14 06:21:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 06:21:25,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:25,009 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:25,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 06:21:25,009 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:25,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:25,009 INFO L85 PathProgramCache]: Analyzing trace with hash 734177974, now seen corresponding path program 1 times [2022-07-14 06:21:25,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:25,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602930604] [2022-07-14 06:21:25,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:25,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:25,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:25,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602930604] [2022-07-14 06:21:25,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602930604] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:21:25,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507030661] [2022-07-14 06:21:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:25,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:21:25,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:21:25,204 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) [2022-07-14 06:21:25,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 06:21:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:25,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-14 06:21:25,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:25,572 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:21:25,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:25,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:25,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:25,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:25,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:21:25,734 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:25,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 41 [2022-07-14 06:21:25,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-07-14 06:21:25,808 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:25,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 41 [2022-07-14 06:21:25,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-07-14 06:21:25,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-14 06:21:25,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:25,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:21:25,886 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_583 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-14 06:21:25,893 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_583 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-14 06:21:25,907 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_580 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_580))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_583)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-14 06:21:25,915 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_580) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_582))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_580 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_580))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_583))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-14 06:21:25,958 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_577 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= 0 (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 v_ArrVal_577)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_581) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc20#1.base|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_582)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_580 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~malloc20#1.base|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_580))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_583))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-14 06:21:26,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:26,299 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:26,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 98 [2022-07-14 06:21:26,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:26,306 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:26,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 90 [2022-07-14 06:21:26,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:26,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:26,327 INFO L356 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-07-14 06:21:26,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 117 [2022-07-14 06:21:26,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:26,343 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-14 06:21:26,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 218 treesize of output 213 [2022-07-14 06:21:26,350 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:21:26,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:21:26,374 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-14 06:21:26,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 29 [2022-07-14 06:21:26,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 106 treesize of output 102 [2022-07-14 06:21:26,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 102 treesize of output 94 [2022-07-14 06:21:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:26,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507030661] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:21:26,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:21:26,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 34 [2022-07-14 06:21:26,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899016994] [2022-07-14 06:21:26,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:21:26,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-14 06:21:26,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:26,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-14 06:21:26,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=673, Unknown=5, NotChecked=290, Total=1122 [2022-07-14 06:21:26,448 INFO L87 Difference]: Start difference. First operand 222 states and 263 transitions. Second operand has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:27,899 INFO L93 Difference]: Finished difference Result 776 states and 926 transitions. [2022-07-14 06:21:27,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-14 06:21:27,907 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-14 06:21:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:27,909 INFO L225 Difference]: With dead ends: 776 [2022-07-14 06:21:27,910 INFO L226 Difference]: Without dead ends: 776 [2022-07-14 06:21:27,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=549, Invalid=2013, Unknown=8, NotChecked=510, Total=3080 [2022-07-14 06:21:27,911 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 602 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 3589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2044 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:27,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1948 Invalid, 3589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1476 Invalid, 0 Unknown, 2044 Unchecked, 0.7s Time] [2022-07-14 06:21:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-07-14 06:21:27,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 278. [2022-07-14 06:21:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 250 states have (on average 1.332) internal successors, (333), 277 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 333 transitions. [2022-07-14 06:21:27,916 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 333 transitions. Word has length 38 [2022-07-14 06:21:27,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:27,916 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 333 transitions. [2022-07-14 06:21:27,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 333 transitions. [2022-07-14 06:21:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 06:21:27,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:27,917 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:27,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:28,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:21:28,125 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:28,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1594589588, now seen corresponding path program 1 times [2022-07-14 06:21:28,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:28,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994150973] [2022-07-14 06:21:28,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:28,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:28,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:28,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994150973] [2022-07-14 06:21:28,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994150973] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:21:28,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953426545] [2022-07-14 06:21:28,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:28,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:21:28,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:21:28,331 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) [2022-07-14 06:21:28,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 06:21:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:28,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-14 06:21:28,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:28,555 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:21:28,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:28,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-14 06:21:28,642 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:28,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 22 [2022-07-14 06:21:28,685 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:28,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:21:28,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:28,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:21:28,828 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-14 06:21:28,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-14 06:21:28,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem16#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_655) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) is different from false [2022-07-14 06:21:28,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_655) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2022-07-14 06:21:28,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int)) (v_ArrVal_654 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_654))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_655) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2022-07-14 06:21:28,845 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int)) (v_ArrVal_654 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_654))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_655) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2022-07-14 06:21:28,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:28,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 36 [2022-07-14 06:21:28,874 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:28,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 256 treesize of output 195 [2022-07-14 06:21:28,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:28,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 180 treesize of output 166 [2022-07-14 06:21:28,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 158 treesize of output 146 [2022-07-14 06:21:29,180 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:21:29,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:21:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:29,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953426545] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:21:29,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:21:29,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-07-14 06:21:29,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870339870] [2022-07-14 06:21:29,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:21:29,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-14 06:21:29,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:29,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 06:21:29,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=466, Unknown=4, NotChecked=188, Total=756 [2022-07-14 06:21:29,189 INFO L87 Difference]: Start difference. First operand 278 states and 333 transitions. Second operand has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:30,715 INFO L93 Difference]: Finished difference Result 809 states and 974 transitions. [2022-07-14 06:21:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-14 06:21:30,716 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-14 06:21:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:30,718 INFO L225 Difference]: With dead ends: 809 [2022-07-14 06:21:30,718 INFO L226 Difference]: Without dead ends: 809 [2022-07-14 06:21:30,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 68 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=407, Invalid=1585, Unknown=4, NotChecked=356, Total=2352 [2022-07-14 06:21:30,719 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 1051 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 3436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1631 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:30,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 1235 Invalid, 3436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1698 Invalid, 0 Unknown, 1631 Unchecked, 1.0s Time] [2022-07-14 06:21:30,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-14 06:21:30,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 402. [2022-07-14 06:21:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 374 states have (on average 1.358288770053476) internal successors, (508), 401 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 508 transitions. [2022-07-14 06:21:30,741 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 508 transitions. Word has length 39 [2022-07-14 06:21:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:30,742 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 508 transitions. [2022-07-14 06:21:30,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:30,742 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 508 transitions. [2022-07-14 06:21:30,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 06:21:30,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:30,743 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:30,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:30,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-14 06:21:30,961 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:30,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1594589587, now seen corresponding path program 1 times [2022-07-14 06:21:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:30,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119811038] [2022-07-14 06:21:30,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:30,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:31,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:31,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119811038] [2022-07-14 06:21:31,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119811038] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:21:31,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069339532] [2022-07-14 06:21:31,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:31,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:21:31,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:21:31,243 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) [2022-07-14 06:21:31,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 06:21:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:31,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-14 06:21:31,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:31,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:31,518 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:21:31,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:31,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:31,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-14 06:21:31,679 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:31,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 37 [2022-07-14 06:21:31,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:21:31,750 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:31,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 37 [2022-07-14 06:21:31,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:21:31,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:31,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-07-14 06:21:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:31,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:21:32,136 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_732 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_732) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_732) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_731) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2022-07-14 06:21:32,144 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_732 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_732) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_732) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_731) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) is different from false [2022-07-14 06:21:32,173 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_729))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_730) .cse0 v_ArrVal_732) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_731) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_730) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_732) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2022-07-14 06:21:32,182 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_729))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_730) .cse1 v_ArrVal_732) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_731) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))))) (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (<= 0 (select (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_730) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_729) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_732)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2022-07-14 06:21:32,206 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:32,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 37 [2022-07-14 06:21:32,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:32,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-07-14 06:21:32,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 42 [2022-07-14 06:21:32,224 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:32,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 100 treesize of output 99 [2022-07-14 06:21:32,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 52 [2022-07-14 06:21:32,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 50 [2022-07-14 06:21:32,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 74 treesize of output 68 [2022-07-14 06:21:32,333 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:32,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 74 [2022-07-14 06:21:32,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:32,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-07-14 06:21:32,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:32,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:32,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2022-07-14 06:21:32,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:32,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-07-14 06:21:32,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 11 [2022-07-14 06:21:32,577 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:21:32,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:21:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:32,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069339532] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:21:32,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:21:32,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-07-14 06:21:32,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480548653] [2022-07-14 06:21:32,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:21:32,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-14 06:21:32,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:32,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-14 06:21:32,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=748, Unknown=4, NotChecked=236, Total=1122 [2022-07-14 06:21:32,586 INFO L87 Difference]: Start difference. First operand 402 states and 508 transitions. Second operand has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:35,107 INFO L93 Difference]: Finished difference Result 964 states and 1163 transitions. [2022-07-14 06:21:35,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-14 06:21:35,108 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-14 06:21:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:35,110 INFO L225 Difference]: With dead ends: 964 [2022-07-14 06:21:35,110 INFO L226 Difference]: Without dead ends: 964 [2022-07-14 06:21:35,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 69 SyntacticMatches, 11 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=799, Invalid=3903, Unknown=6, NotChecked=548, Total=5256 [2022-07-14 06:21:35,112 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 1580 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 3506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1764 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:35,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 1480 Invalid, 3506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1582 Invalid, 0 Unknown, 1764 Unchecked, 1.1s Time] [2022-07-14 06:21:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2022-07-14 06:21:35,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 405. [2022-07-14 06:21:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 383 states have (on average 1.349869451697128) internal successors, (517), 404 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 517 transitions. [2022-07-14 06:21:35,140 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 517 transitions. Word has length 39 [2022-07-14 06:21:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:35,140 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 517 transitions. [2022-07-14 06:21:35,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 517 transitions. [2022-07-14 06:21:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 06:21:35,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:35,141 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:35,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:35,358 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,SelfDestructingSolverStorable27 [2022-07-14 06:21:35,358 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:35,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1594404890, now seen corresponding path program 1 times [2022-07-14 06:21:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:35,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871445566] [2022-07-14 06:21:35,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:35,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:21:35,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:35,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871445566] [2022-07-14 06:21:35,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871445566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:35,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:35,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:21:35,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351659365] [2022-07-14 06:21:35,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:35,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:21:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:35,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:21:35,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:21:35,435 INFO L87 Difference]: Start difference. First operand 405 states and 517 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:35,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:35,539 INFO L93 Difference]: Finished difference Result 405 states and 514 transitions. [2022-07-14 06:21:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:21:35,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-14 06:21:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:35,551 INFO L225 Difference]: With dead ends: 405 [2022-07-14 06:21:35,551 INFO L226 Difference]: Without dead ends: 405 [2022-07-14 06:21:35,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:21:35,552 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 14 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:35,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 258 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:21:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-07-14 06:21:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2022-07-14 06:21:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 380 states have (on average 1.3447368421052632) internal successors, (511), 401 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 511 transitions. [2022-07-14 06:21:35,572 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 511 transitions. Word has length 39 [2022-07-14 06:21:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:35,573 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 511 transitions. [2022-07-14 06:21:35,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 511 transitions. [2022-07-14 06:21:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 06:21:35,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:35,574 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:35,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 06:21:35,574 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:35,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:35,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1677406060, now seen corresponding path program 1 times [2022-07-14 06:21:35,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:35,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287847201] [2022-07-14 06:21:35,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:35,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:35,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:35,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287847201] [2022-07-14 06:21:35,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287847201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:35,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:35,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-14 06:21:35,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752048183] [2022-07-14 06:21:35,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:35,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:21:35,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:35,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:21:35,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:21:35,845 INFO L87 Difference]: Start difference. First operand 402 states and 511 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:36,536 INFO L93 Difference]: Finished difference Result 543 states and 671 transitions. [2022-07-14 06:21:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:21:36,536 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-14 06:21:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:36,538 INFO L225 Difference]: With dead ends: 543 [2022-07-14 06:21:36,538 INFO L226 Difference]: Without dead ends: 543 [2022-07-14 06:21:36,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2022-07-14 06:21:36,539 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 253 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:36,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 847 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:21:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-07-14 06:21:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 396. [2022-07-14 06:21:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 374 states have (on average 1.36096256684492) internal successors, (509), 395 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 509 transitions. [2022-07-14 06:21:36,561 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 509 transitions. Word has length 39 [2022-07-14 06:21:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:36,561 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 509 transitions. [2022-07-14 06:21:36,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 509 transitions. [2022-07-14 06:21:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:21:36,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:36,562 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:36,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-14 06:21:36,562 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:36,564 INFO L85 PathProgramCache]: Analyzing trace with hash 982584715, now seen corresponding path program 1 times [2022-07-14 06:21:36,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:36,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919609279] [2022-07-14 06:21:36,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:36,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:36,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:36,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919609279] [2022-07-14 06:21:36,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919609279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:36,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:36,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 06:21:36,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766103236] [2022-07-14 06:21:36,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:36,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:21:36,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:36,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:21:36,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:21:36,783 INFO L87 Difference]: Start difference. First operand 396 states and 509 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:37,246 INFO L93 Difference]: Finished difference Result 595 states and 734 transitions. [2022-07-14 06:21:37,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:21:37,247 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-14 06:21:37,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:37,249 INFO L225 Difference]: With dead ends: 595 [2022-07-14 06:21:37,249 INFO L226 Difference]: Without dead ends: 591 [2022-07-14 06:21:37,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2022-07-14 06:21:37,250 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 465 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:37,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 548 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:21:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-07-14 06:21:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 446. [2022-07-14 06:21:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 424 states have (on average 1.3514150943396226) internal successors, (573), 445 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 573 transitions. [2022-07-14 06:21:37,256 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 573 transitions. Word has length 41 [2022-07-14 06:21:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:37,256 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 573 transitions. [2022-07-14 06:21:37,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 573 transitions. [2022-07-14 06:21:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:21:37,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:37,257 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:37,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-14 06:21:37,257 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:37,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1454341771, now seen corresponding path program 1 times [2022-07-14 06:21:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:37,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279638589] [2022-07-14 06:21:37,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:37,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:37,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:37,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279638589] [2022-07-14 06:21:37,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279638589] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:21:37,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942289290] [2022-07-14 06:21:37,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:37,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:21:37,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:21:37,416 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) [2022-07-14 06:21:37,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 06:21:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:37,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-14 06:21:37,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:37,689 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:21:37,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:37,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:37,802 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:37,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-07-14 06:21:37,866 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:37,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-07-14 06:21:38,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:38,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-14 06:21:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:38,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:21:38,311 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:38,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 37 [2022-07-14 06:21:38,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:38,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 294 treesize of output 255 [2022-07-14 06:21:38,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 236 treesize of output 220 [2022-07-14 06:21:38,351 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:38,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 220 treesize of output 200 [2022-07-14 06:21:48,010 INFO L356 Elim1Store]: treesize reduction 5, result has 97.8 percent of original size [2022-07-14 06:21:48,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 185 treesize of output 388 [2022-07-14 06:21:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:50,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942289290] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:21:50,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:21:50,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2022-07-14 06:21:50,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178278885] [2022-07-14 06:21:50,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:21:50,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 06:21:50,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:50,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 06:21:50,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=977, Unknown=27, NotChecked=0, Total=1190 [2022-07-14 06:21:50,591 INFO L87 Difference]: Start difference. First operand 446 states and 573 transitions. Second operand has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:51,533 INFO L93 Difference]: Finished difference Result 684 states and 863 transitions. [2022-07-14 06:21:51,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 06:21:51,542 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-14 06:21:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:51,544 INFO L225 Difference]: With dead ends: 684 [2022-07-14 06:21:51,544 INFO L226 Difference]: Without dead ends: 684 [2022-07-14 06:21:51,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=557, Invalid=2172, Unknown=27, NotChecked=0, Total=2756 [2022-07-14 06:21:51,547 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 866 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1131 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:51,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1345 Invalid, 1995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 812 Invalid, 0 Unknown, 1131 Unchecked, 0.4s Time] [2022-07-14 06:21:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-07-14 06:21:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 526. [2022-07-14 06:21:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 504 states have (on average 1.3551587301587302) internal successors, (683), 525 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 683 transitions. [2022-07-14 06:21:51,559 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 683 transitions. Word has length 41 [2022-07-14 06:21:51,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:51,559 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 683 transitions. [2022-07-14 06:21:51,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:51,559 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 683 transitions. [2022-07-14 06:21:51,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:21:51,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:51,560 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:51,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:51,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:21:51,778 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:21:51,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:51,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1454341772, now seen corresponding path program 1 times [2022-07-14 06:21:51,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:51,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330012570] [2022-07-14 06:21:51,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:51,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:52,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:52,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330012570] [2022-07-14 06:21:52,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330012570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:21:52,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700238784] [2022-07-14 06:21:52,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:52,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:21:52,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:21:52,048 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) [2022-07-14 06:21:52,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 06:21:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:52,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-14 06:21:52,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:52,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:52,252 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:21:52,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:52,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:52,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:21:52,359 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:52,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-07-14 06:21:52,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:21:52,409 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:52,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-07-14 06:21:52,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:21:52,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:52,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-07-14 06:21:52,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:52,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-14 06:21:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:52,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:21:52,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~n~0#1.offset_74| Int) (v_ArrVal_984 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (let ((.cse1 (+ |v_ULTIMATE.start_main_~n~0#1.offset_74| 4))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_984) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (and (<= 0 .cse0) (<= (+ .cse0 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_983) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)))))) (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_74|)) (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_74| |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2022-07-14 06:21:53,071 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:53,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 89 treesize of output 90 [2022-07-14 06:21:53,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:53,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 60 [2022-07-14 06:21:53,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:53,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 754 treesize of output 655 [2022-07-14 06:21:53,102 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:53,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2262 treesize of output 2127 [2022-07-14 06:21:53,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2108 treesize of output 1948 [2022-07-14 06:21:53,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1948 treesize of output 1788 [2022-07-14 06:21:53,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1788 treesize of output 1724 [2022-07-14 06:21:53,148 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:53,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1724 treesize of output 1440 [2022-07-14 06:22:46,132 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:46,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 45 [2022-07-14 06:22:46,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:46,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-14 06:22:46,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:46,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:22:46,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:46,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:46,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:22:46,494 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:22:46,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:22:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:46,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700238784] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:46,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:22:46,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 37 [2022-07-14 06:22:46,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39996022] [2022-07-14 06:22:46,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:46,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-14 06:22:46,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:46,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-14 06:22:46,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1125, Unknown=26, NotChecked=70, Total=1406 [2022-07-14 06:22:46,558 INFO L87 Difference]: Start difference. First operand 526 states and 683 transitions. Second operand has 38 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:48,721 INFO L93 Difference]: Finished difference Result 1428 states and 1816 transitions. [2022-07-14 06:22:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-14 06:22:48,723 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-14 06:22:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:48,727 INFO L225 Difference]: With dead ends: 1428 [2022-07-14 06:22:48,728 INFO L226 Difference]: Without dead ends: 1428 [2022-07-14 06:22:48,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=893, Invalid=3507, Unknown=26, NotChecked=130, Total=4556 [2022-07-14 06:22:48,729 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 1685 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1406 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:48,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1685 Valid, 1867 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2085 Invalid, 0 Unknown, 1406 Unchecked, 1.1s Time] [2022-07-14 06:22:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2022-07-14 06:22:48,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 908. [2022-07-14 06:22:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.3871331828442437) internal successors, (1229), 907 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1229 transitions. [2022-07-14 06:22:48,747 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1229 transitions. Word has length 41 [2022-07-14 06:22:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:48,747 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1229 transitions. [2022-07-14 06:22:48,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1229 transitions. [2022-07-14 06:22:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:22:48,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:48,748 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:48,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 [2022-07-14 06:22:48,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:22:48,951 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:22:48,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:48,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1351336816, now seen corresponding path program 1 times [2022-07-14 06:22:48,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:48,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974420381] [2022-07-14 06:22:48,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:48,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:49,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:49,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974420381] [2022-07-14 06:22:49,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974420381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:49,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:49,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 06:22:49,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386504093] [2022-07-14 06:22:49,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:49,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:22:49,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:49,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:22:49,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:22:49,103 INFO L87 Difference]: Start difference. First operand 908 states and 1229 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:49,438 INFO L93 Difference]: Finished difference Result 1201 states and 1588 transitions. [2022-07-14 06:22:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:22:49,439 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-14 06:22:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:49,441 INFO L225 Difference]: With dead ends: 1201 [2022-07-14 06:22:49,441 INFO L226 Difference]: Without dead ends: 1195 [2022-07-14 06:22:49,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:22:49,442 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 257 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:49,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 692 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:22:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-07-14 06:22:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 886. [2022-07-14 06:22:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 864 states have (on average 1.3854166666666667) internal successors, (1197), 885 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1197 transitions. [2022-07-14 06:22:49,453 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1197 transitions. Word has length 43 [2022-07-14 06:22:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:49,453 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 1197 transitions. [2022-07-14 06:22:49,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1197 transitions. [2022-07-14 06:22:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:22:49,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:49,454 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:49,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-14 06:22:49,454 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:22:49,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:49,454 INFO L85 PathProgramCache]: Analyzing trace with hash -556665744, now seen corresponding path program 1 times [2022-07-14 06:22:49,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:49,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559159177] [2022-07-14 06:22:49,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:49,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:49,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559159177] [2022-07-14 06:22:49,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559159177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:49,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:49,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 06:22:49,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201562393] [2022-07-14 06:22:49,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:49,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:22:49,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:49,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:22:49,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:22:49,581 INFO L87 Difference]: Start difference. First operand 886 states and 1197 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:50,027 INFO L93 Difference]: Finished difference Result 1197 states and 1598 transitions. [2022-07-14 06:22:50,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:22:50,027 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-14 06:22:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:50,030 INFO L225 Difference]: With dead ends: 1197 [2022-07-14 06:22:50,030 INFO L226 Difference]: Without dead ends: 1197 [2022-07-14 06:22:50,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2022-07-14 06:22:50,031 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 253 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:50,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 770 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:22:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2022-07-14 06:22:50,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 886. [2022-07-14 06:22:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 864 states have (on average 1.380787037037037) internal successors, (1193), 885 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1193 transitions. [2022-07-14 06:22:50,052 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1193 transitions. Word has length 43 [2022-07-14 06:22:50,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:50,052 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 1193 transitions. [2022-07-14 06:22:50,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1193 transitions. [2022-07-14 06:22:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:22:50,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:50,053 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:50,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-14 06:22:50,054 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-14 06:22:50,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:50,055 INFO L85 PathProgramCache]: Analyzing trace with hash -659312340, now seen corresponding path program 1 times [2022-07-14 06:22:50,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:50,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437481464] [2022-07-14 06:22:50,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:50,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:50,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:50,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437481464] [2022-07-14 06:22:50,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437481464] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:22:50,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251494273] [2022-07-14 06:22:50,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:50,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:22:50,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:22:50,241 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) [2022-07-14 06:22:50,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 06:22:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:50,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 06:22:50,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:50,453 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:22:50,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:22:50,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:22:50,537 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:50,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-07-14 06:22:50,580 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:50,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-07-14 06:22:50,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:50,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-07-14 06:22:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:50,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:52,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:52,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 37 [2022-07-14 06:22:52,713 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:52,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 170 treesize of output 149 [2022-07-14 06:22:52,721 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:52,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 130 treesize of output 122 [2022-07-14 06:22:52,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 treesize of output 102 [2022-07-14 06:23:15,035 INFO L356 Elim1Store]: treesize reduction 5, result has 99.5 percent of original size [2022-07-14 06:23:15,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 415 treesize of output 1338