./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0217.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 26d01a9c 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/test-0217.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 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 02:49:19,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:49:19,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:49:19,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:49:19,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:49:19,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:49:19,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:49:19,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:49:19,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:49:19,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:49:19,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:49:19,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:49:19,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:49:19,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:49:19,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:49:19,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:49:19,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:49:19,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:49:19,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:49:19,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:49:19,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:49:19,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:49:19,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:49:19,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:49:19,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:49:19,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:49:19,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:49:19,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:49:19,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:49:19,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:49:19,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:49:19,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:49:19,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:49:19,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:49:19,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:49:19,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:49:19,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:49:19,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:49:19,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:49:19,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:49:19,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:49:19,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 02:49:19,528 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:49:19,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:49:19,529 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:49:19,529 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:49:19,530 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:49:19,530 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:49:19,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:49:19,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:49:19,531 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:49:19,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:49:19,532 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:49:19,532 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 02:49:19,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:49:19,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:49:19,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:49:19,533 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 02:49:19,533 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 02:49:19,533 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 02:49:19,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:49:19,533 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 02:49:19,533 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:49:19,534 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:49:19,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:49:19,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:49:19,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:49:19,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:49:19,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:49:19,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:49:19,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:49:19,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:49:19,535 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:49:19,536 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:49:19,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:49:19,536 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:49:19,536 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec [2023-02-17 02:49:19,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:49:19,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:49:19,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:49:19,770 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:49:19,770 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:49:19,771 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0217.i [2023-02-17 02:49:20,688 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:49:20,957 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:49:20,960 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0217.i [2023-02-17 02:49:20,976 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/410300a81/316c83f222f04b6dad46bc95bd9f3fe3/FLAG895833f7c [2023-02-17 02:49:20,990 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/410300a81/316c83f222f04b6dad46bc95bd9f3fe3 [2023-02-17 02:49:20,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:49:20,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:49:20,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:49:20,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:49:20,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:49:20,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:49:20" (1/1) ... [2023-02-17 02:49:20,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34634ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:20, skipping insertion in model container [2023-02-17 02:49:20,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:49:20" (1/1) ... [2023-02-17 02:49:21,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:49:21,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:49:21,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:49:21,332 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:49:21,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:49:21,419 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:49:21,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:21 WrapperNode [2023-02-17 02:49:21,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:49:21,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:49:21,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:49:21,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:49:21,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:21" (1/1) ... [2023-02-17 02:49:21,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:21" (1/1) ... [2023-02-17 02:49:21,457 INFO L138 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 210 [2023-02-17 02:49:21,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:49:21,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:49:21,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:49:21,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:49:21,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:21" (1/1) ... [2023-02-17 02:49:21,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:21" (1/1) ... [2023-02-17 02:49:21,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:21" (1/1) ... [2023-02-17 02:49:21,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:21" (1/1) ... [2023-02-17 02:49:21,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:21" (1/1) ... [2023-02-17 02:49:21,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:21" (1/1) ... [2023-02-17 02:49:21,490 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:21" (1/1) ... [2023-02-17 02:49:21,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:21" (1/1) ... [2023-02-17 02:49:21,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:49:21,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:49:21,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:49:21,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:49:21,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:21" (1/1) ... [2023-02-17 02:49:21,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:49:21,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:49:21,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 02:49:21,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 02:49:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2023-02-17 02:49:21,553 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2023-02-17 02:49:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 02:49:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 02:49:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:49:21,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 02:49:21,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 02:49:21,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 02:49:21,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 02:49:21,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 02:49:21,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:49:21,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:49:21,684 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:49:21,686 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:49:22,060 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:49:22,069 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:49:22,070 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-17 02:49:22,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:49:22 BoogieIcfgContainer [2023-02-17 02:49:22,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:49:22,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:49:22,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:49:22,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:49:22,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:49:20" (1/3) ... [2023-02-17 02:49:22,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed5e36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:49:22, skipping insertion in model container [2023-02-17 02:49:22,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:21" (2/3) ... [2023-02-17 02:49:22,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed5e36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:49:22, skipping insertion in model container [2023-02-17 02:49:22,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:49:22" (3/3) ... [2023-02-17 02:49:22,079 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0217.i [2023-02-17 02:49:22,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:49:22,092 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2023-02-17 02:49:22,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:49:22,139 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1c8b8d6a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:49:22,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2023-02-17 02:49:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 163 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 02:49:22,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 02:49:22,148 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:22,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 02:49:22,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:22,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:22,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1074518762, now seen corresponding path program 1 times [2023-02-17 02:49:22,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:22,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774043559] [2023-02-17 02:49:22,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:22,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:22,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:22,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774043559] [2023-02-17 02:49:22,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774043559] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:22,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:22,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:49:22,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563691266] [2023-02-17 02:49:22,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:22,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 02:49:22,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:22,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 02:49:22,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:49:22,301 INFO L87 Difference]: Start difference. First operand has 167 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 163 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2023-02-17 02:49:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:22,328 INFO L93 Difference]: Finished difference Result 167 states and 186 transitions. [2023-02-17 02:49:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 02:49:22,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-02-17 02:49:22,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:22,334 INFO L225 Difference]: With dead ends: 167 [2023-02-17 02:49:22,334 INFO L226 Difference]: Without dead ends: 165 [2023-02-17 02:49:22,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:49:22,338 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:22,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:49:22,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-17 02:49:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2023-02-17 02:49:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 95 states have (on average 1.894736842105263) internal successors, (180), 161 states have internal predecessors, (180), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 02:49:22,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 184 transitions. [2023-02-17 02:49:22,367 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 184 transitions. Word has length 6 [2023-02-17 02:49:22,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:22,368 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 184 transitions. [2023-02-17 02:49:22,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2023-02-17 02:49:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 184 transitions. [2023-02-17 02:49:22,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 02:49:22,368 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:22,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:22,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 02:49:22,369 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:22,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:22,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1280331232, now seen corresponding path program 1 times [2023-02-17 02:49:22,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:22,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160539880] [2023-02-17 02:49:22,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:22,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:22,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:22,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160539880] [2023-02-17 02:49:22,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160539880] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:22,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:22,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-17 02:49:22,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300580137] [2023-02-17 02:49:22,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:22,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:49:22,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:22,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:49:22,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:49:22,434 INFO L87 Difference]: Start difference. First operand 165 states and 184 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2023-02-17 02:49:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:22,631 INFO L93 Difference]: Finished difference Result 321 states and 358 transitions. [2023-02-17 02:49:22,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:49:22,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 [2023-02-17 02:49:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:22,634 INFO L225 Difference]: With dead ends: 321 [2023-02-17 02:49:22,634 INFO L226 Difference]: Without dead ends: 321 [2023-02-17 02:49:22,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:49:22,635 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 165 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:22,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 237 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:49:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-02-17 02:49:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 229. [2023-02-17 02:49:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 156 states have (on average 1.8717948717948718) internal successors, (292), 222 states have internal predecessors, (292), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 02:49:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 300 transitions. [2023-02-17 02:49:22,650 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 300 transitions. Word has length 7 [2023-02-17 02:49:22,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:22,651 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 300 transitions. [2023-02-17 02:49:22,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2023-02-17 02:49:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 300 transitions. [2023-02-17 02:49:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 02:49:22,651 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:22,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:22,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 02:49:22,652 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1280331231, now seen corresponding path program 1 times [2023-02-17 02:49:22,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:22,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697876138] [2023-02-17 02:49:22,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:22,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:22,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:22,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697876138] [2023-02-17 02:49:22,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697876138] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:22,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:22,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:49:22,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116518061] [2023-02-17 02:49:22,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:22,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:49:22,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:22,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:49:22,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:22,750 INFO L87 Difference]: Start difference. First operand 229 states and 300 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) [2023-02-17 02:49:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:22,998 INFO L93 Difference]: Finished difference Result 368 states and 462 transitions. [2023-02-17 02:49:22,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 02:49:22,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 [2023-02-17 02:49:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:23,000 INFO L225 Difference]: With dead ends: 368 [2023-02-17 02:49:23,001 INFO L226 Difference]: Without dead ends: 368 [2023-02-17 02:49:23,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:23,010 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 135 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:23,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 394 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:49:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2023-02-17 02:49:23,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 302. [2023-02-17 02:49:23,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 223 states have (on average 1.8340807174887892) internal successors, (409), 291 states have internal predecessors, (409), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 02:49:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2023-02-17 02:49:23,034 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 7 [2023-02-17 02:49:23,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:23,034 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2023-02-17 02:49:23,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) [2023-02-17 02:49:23,035 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2023-02-17 02:49:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 02:49:23,035 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:23,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:23,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 02:49:23,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:23,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:23,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1280331169, now seen corresponding path program 1 times [2023-02-17 02:49:23,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:23,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441026436] [2023-02-17 02:49:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:23,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:23,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:23,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441026436] [2023-02-17 02:49:23,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441026436] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:23,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:23,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:49:23,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329544680] [2023-02-17 02:49:23,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:23,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:49:23,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:23,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:49:23,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:23,103 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) [2023-02-17 02:49:23,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:23,253 INFO L93 Difference]: Finished difference Result 367 states and 460 transitions. [2023-02-17 02:49:23,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 02:49:23,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 [2023-02-17 02:49:23,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:23,255 INFO L225 Difference]: With dead ends: 367 [2023-02-17 02:49:23,256 INFO L226 Difference]: Without dead ends: 367 [2023-02-17 02:49:23,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:23,264 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 117 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:23,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 408 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-02-17 02:49:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 302. [2023-02-17 02:49:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 223 states have (on average 1.8340807174887892) internal successors, (409), 291 states have internal predecessors, (409), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 02:49:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2023-02-17 02:49:23,279 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 7 [2023-02-17 02:49:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:23,279 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2023-02-17 02:49:23,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) [2023-02-17 02:49:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2023-02-17 02:49:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 02:49:23,280 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:23,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:23,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 02:49:23,280 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1257058894, now seen corresponding path program 1 times [2023-02-17 02:49:23,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:23,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801565121] [2023-02-17 02:49:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:23,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:23,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:23,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801565121] [2023-02-17 02:49:23,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801565121] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:23,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:23,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:49:23,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189865366] [2023-02-17 02:49:23,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:23,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:23,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:23,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:23,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:23,388 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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) [2023-02-17 02:49:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:23,546 INFO L93 Difference]: Finished difference Result 449 states and 603 transitions. [2023-02-17 02:49:23,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:49:23,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 [2023-02-17 02:49:23,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:23,549 INFO L225 Difference]: With dead ends: 449 [2023-02-17 02:49:23,550 INFO L226 Difference]: Without dead ends: 449 [2023-02-17 02:49:23,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-17 02:49:23,550 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 146 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:23,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 729 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-02-17 02:49:23,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 344. [2023-02-17 02:49:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 262 states have (on average 1.816793893129771) internal successors, (476), 331 states have internal predecessors, (476), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:49:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 496 transitions. [2023-02-17 02:49:23,563 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 496 transitions. Word has length 10 [2023-02-17 02:49:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:23,563 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 496 transitions. [2023-02-17 02:49:23,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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) [2023-02-17 02:49:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 496 transitions. [2023-02-17 02:49:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 02:49:23,564 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:23,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:23,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 02:49:23,565 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:23,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:23,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1258905936, now seen corresponding path program 1 times [2023-02-17 02:49:23,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:23,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889854992] [2023-02-17 02:49:23,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:23,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:23,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:23,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889854992] [2023-02-17 02:49:23,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889854992] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:23,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:23,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:49:23,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862961846] [2023-02-17 02:49:23,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:23,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:23,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:23,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:23,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:23,632 INFO L87 Difference]: Start difference. First operand 344 states and 496 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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) [2023-02-17 02:49:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:23,784 INFO L93 Difference]: Finished difference Result 439 states and 592 transitions. [2023-02-17 02:49:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:49:23,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 [2023-02-17 02:49:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:23,786 INFO L225 Difference]: With dead ends: 439 [2023-02-17 02:49:23,786 INFO L226 Difference]: Without dead ends: 439 [2023-02-17 02:49:23,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:49:23,787 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 125 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:23,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 743 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:23,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-02-17 02:49:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 343. [2023-02-17 02:49:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 261 states have (on average 1.8199233716475096) internal successors, (475), 330 states have internal predecessors, (475), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:49:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 495 transitions. [2023-02-17 02:49:23,794 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 495 transitions. Word has length 10 [2023-02-17 02:49:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:23,794 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 495 transitions. [2023-02-17 02:49:23,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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) [2023-02-17 02:49:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 495 transitions. [2023-02-17 02:49:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 02:49:23,795 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:23,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:23,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 02:49:23,796 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:23,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:23,796 INFO L85 PathProgramCache]: Analyzing trace with hash 314118792, now seen corresponding path program 1 times [2023-02-17 02:49:23,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:23,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724130211] [2023-02-17 02:49:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:23,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:23,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:23,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724130211] [2023-02-17 02:49:23,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724130211] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:23,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:23,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:49:23,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364287914] [2023-02-17 02:49:23,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:23,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:49:23,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:23,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:49:23,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:49:23,813 INFO L87 Difference]: Start difference. First operand 343 states and 495 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2023-02-17 02:49:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:23,886 INFO L93 Difference]: Finished difference Result 394 states and 542 transitions. [2023-02-17 02:49:23,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:49:23,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2023-02-17 02:49:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:23,888 INFO L225 Difference]: With dead ends: 394 [2023-02-17 02:49:23,888 INFO L226 Difference]: Without dead ends: 387 [2023-02-17 02:49:23,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:49:23,889 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 64 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:23,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 275 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2023-02-17 02:49:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 340. [2023-02-17 02:49:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 258 states have (on average 1.821705426356589) internal successors, (470), 327 states have internal predecessors, (470), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:49:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 490 transitions. [2023-02-17 02:49:23,894 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 490 transitions. Word has length 11 [2023-02-17 02:49:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:23,895 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 490 transitions. [2023-02-17 02:49:23,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2023-02-17 02:49:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 490 transitions. [2023-02-17 02:49:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 02:49:23,895 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:23,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:23,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 02:49:23,895 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:23,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:23,896 INFO L85 PathProgramCache]: Analyzing trace with hash -584855357, now seen corresponding path program 1 times [2023-02-17 02:49:23,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:23,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051150836] [2023-02-17 02:49:23,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:23,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:23,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 02:49:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:23,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:23,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051150836] [2023-02-17 02:49:23,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051150836] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:23,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:23,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 02:49:23,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249491894] [2023-02-17 02:49:23,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:23,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:49:23,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:23,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:49:23,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:23,944 INFO L87 Difference]: Start difference. First operand 340 states and 490 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:24,113 INFO L93 Difference]: Finished difference Result 554 states and 710 transitions. [2023-02-17 02:49:24,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 02:49:24,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-17 02:49:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:24,117 INFO L225 Difference]: With dead ends: 554 [2023-02-17 02:49:24,117 INFO L226 Difference]: Without dead ends: 554 [2023-02-17 02:49:24,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:24,118 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 317 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:24,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 416 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:49:24,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2023-02-17 02:49:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 346. [2023-02-17 02:49:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 264 states have (on average 1.803030303030303) internal successors, (476), 333 states have internal predecessors, (476), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:49:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 496 transitions. [2023-02-17 02:49:24,132 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 496 transitions. Word has length 15 [2023-02-17 02:49:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:24,133 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 496 transitions. [2023-02-17 02:49:24,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 496 transitions. [2023-02-17 02:49:24,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 02:49:24,133 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:24,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:24,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 02:49:24,133 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:24,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:24,134 INFO L85 PathProgramCache]: Analyzing trace with hash -584855356, now seen corresponding path program 1 times [2023-02-17 02:49:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:24,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8193883] [2023-02-17 02:49:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:24,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:24,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 02:49:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:24,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:24,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8193883] [2023-02-17 02:49:24,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8193883] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:24,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:24,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 02:49:24,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144447015] [2023-02-17 02:49:24,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:24,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:49:24,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:24,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:49:24,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:24,226 INFO L87 Difference]: Start difference. First operand 346 states and 496 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:24,359 INFO L93 Difference]: Finished difference Result 400 states and 518 transitions. [2023-02-17 02:49:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 02:49:24,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-17 02:49:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:24,361 INFO L225 Difference]: With dead ends: 400 [2023-02-17 02:49:24,361 INFO L226 Difference]: Without dead ends: 400 [2023-02-17 02:49:24,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:24,362 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 185 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:24,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 416 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-02-17 02:49:24,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 346. [2023-02-17 02:49:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 264 states have (on average 1.768939393939394) internal successors, (467), 333 states have internal predecessors, (467), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:49:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 487 transitions. [2023-02-17 02:49:24,368 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 487 transitions. Word has length 15 [2023-02-17 02:49:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:24,368 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 487 transitions. [2023-02-17 02:49:24,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:24,368 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 487 transitions. [2023-02-17 02:49:24,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 02:49:24,369 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:24,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:24,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 02:49:24,369 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:24,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:24,370 INFO L85 PathProgramCache]: Analyzing trace with hash 590215118, now seen corresponding path program 1 times [2023-02-17 02:49:24,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:24,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750467880] [2023-02-17 02:49:24,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:24,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:24,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:24,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:24,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750467880] [2023-02-17 02:49:24,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750467880] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:24,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:24,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:49:24,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858167764] [2023-02-17 02:49:24,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:24,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:49:24,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:24,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:49:24,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:24,416 INFO L87 Difference]: Start difference. First operand 346 states and 487 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:24,675 INFO L93 Difference]: Finished difference Result 683 states and 818 transitions. [2023-02-17 02:49:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:49:24,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-17 02:49:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:24,678 INFO L225 Difference]: With dead ends: 683 [2023-02-17 02:49:24,678 INFO L226 Difference]: Without dead ends: 683 [2023-02-17 02:49:24,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:49:24,678 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 837 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:24,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 485 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:49:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2023-02-17 02:49:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 343. [2023-02-17 02:49:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 265 states have (on average 1.739622641509434) internal successors, (461), 330 states have internal predecessors, (461), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:49:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 481 transitions. [2023-02-17 02:49:24,686 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 481 transitions. Word has length 17 [2023-02-17 02:49:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:24,686 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 481 transitions. [2023-02-17 02:49:24,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 481 transitions. [2023-02-17 02:49:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 02:49:24,686 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:24,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:24,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-17 02:49:24,687 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:24,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash 590215119, now seen corresponding path program 1 times [2023-02-17 02:49:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:24,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501716002] [2023-02-17 02:49:24,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:24,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:24,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:24,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:24,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501716002] [2023-02-17 02:49:24,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501716002] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:24,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:24,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:49:24,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953256881] [2023-02-17 02:49:24,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:24,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:24,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:24,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:24,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:24,776 INFO L87 Difference]: Start difference. First operand 343 states and 481 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:25,250 INFO L93 Difference]: Finished difference Result 742 states and 915 transitions. [2023-02-17 02:49:25,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:49:25,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-17 02:49:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:25,253 INFO L225 Difference]: With dead ends: 742 [2023-02-17 02:49:25,253 INFO L226 Difference]: Without dead ends: 742 [2023-02-17 02:49:25,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-02-17 02:49:25,253 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 626 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:25,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 619 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:49:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2023-02-17 02:49:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 376. [2023-02-17 02:49:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 296 states have (on average 1.7263513513513513) internal successors, (511), 362 states have internal predecessors, (511), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2023-02-17 02:49:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 535 transitions. [2023-02-17 02:49:25,273 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 535 transitions. Word has length 17 [2023-02-17 02:49:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:25,274 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 535 transitions. [2023-02-17 02:49:25,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 535 transitions. [2023-02-17 02:49:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 02:49:25,277 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:25,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:25,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-17 02:49:25,277 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1217239344, now seen corresponding path program 1 times [2023-02-17 02:49:25,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:25,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978891356] [2023-02-17 02:49:25,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:25,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:25,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:25,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978891356] [2023-02-17 02:49:25,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978891356] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:25,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:25,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:49:25,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858845203] [2023-02-17 02:49:25,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:25,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:25,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:25,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:25,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:25,338 INFO L87 Difference]: Start difference. First operand 376 states and 535 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:25,427 INFO L93 Difference]: Finished difference Result 602 states and 831 transitions. [2023-02-17 02:49:25,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:49:25,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-17 02:49:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:25,429 INFO L225 Difference]: With dead ends: 602 [2023-02-17 02:49:25,429 INFO L226 Difference]: Without dead ends: 602 [2023-02-17 02:49:25,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:49:25,430 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 239 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:25,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1353 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2023-02-17 02:49:25,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2023-02-17 02:49:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 303 states have (on average 1.7062706270627064) internal successors, (517), 371 states have internal predecessors, (517), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 547 transitions. [2023-02-17 02:49:25,451 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 547 transitions. Word has length 17 [2023-02-17 02:49:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:25,451 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 547 transitions. [2023-02-17 02:49:25,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 547 transitions. [2023-02-17 02:49:25,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 02:49:25,452 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:25,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:25,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-17 02:49:25,452 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:25,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:25,453 INFO L85 PathProgramCache]: Analyzing trace with hash 920341577, now seen corresponding path program 1 times [2023-02-17 02:49:25,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:25,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188521170] [2023-02-17 02:49:25,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:25,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:25,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:25,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:25,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188521170] [2023-02-17 02:49:25,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188521170] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:25,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:25,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:49:25,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501492573] [2023-02-17 02:49:25,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:25,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 02:49:25,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:25,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 02:49:25,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:49:25,569 INFO L87 Difference]: Start difference. First operand 386 states and 547 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:26,113 INFO L93 Difference]: Finished difference Result 769 states and 957 transitions. [2023-02-17 02:49:26,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:49:26,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-17 02:49:26,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:26,116 INFO L225 Difference]: With dead ends: 769 [2023-02-17 02:49:26,116 INFO L226 Difference]: Without dead ends: 769 [2023-02-17 02:49:26,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:49:26,117 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 777 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:26,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 745 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 02:49:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2023-02-17 02:49:26,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 383. [2023-02-17 02:49:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 300 states have (on average 1.7066666666666668) internal successors, (512), 368 states have internal predecessors, (512), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 542 transitions. [2023-02-17 02:49:26,133 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 542 transitions. Word has length 18 [2023-02-17 02:49:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:26,133 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 542 transitions. [2023-02-17 02:49:26,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 542 transitions. [2023-02-17 02:49:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 02:49:26,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:26,134 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] [2023-02-17 02:49:26,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-17 02:49:26,134 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:26,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:26,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1931813849, now seen corresponding path program 1 times [2023-02-17 02:49:26,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:26,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003667401] [2023-02-17 02:49:26,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:26,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:26,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 02:49:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:26,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:26,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003667401] [2023-02-17 02:49:26,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003667401] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:26,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:26,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-17 02:49:26,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302702788] [2023-02-17 02:49:26,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:26,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 02:49:26,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:26,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 02:49:26,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:49:26,305 INFO L87 Difference]: Start difference. First operand 383 states and 542 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:26,721 INFO L93 Difference]: Finished difference Result 793 states and 1091 transitions. [2023-02-17 02:49:26,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 02:49:26,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-17 02:49:26,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:26,725 INFO L225 Difference]: With dead ends: 793 [2023-02-17 02:49:26,725 INFO L226 Difference]: Without dead ends: 791 [2023-02-17 02:49:26,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-02-17 02:49:26,725 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 544 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:26,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1423 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:49:26,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2023-02-17 02:49:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 377. [2023-02-17 02:49:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 294 states have (on average 1.7040816326530612) internal successors, (501), 362 states have internal predecessors, (501), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 531 transitions. [2023-02-17 02:49:26,737 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 531 transitions. Word has length 21 [2023-02-17 02:49:26,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:26,737 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 531 transitions. [2023-02-17 02:49:26,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 531 transitions. [2023-02-17 02:49:26,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 02:49:26,738 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:26,738 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] [2023-02-17 02:49:26,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-17 02:49:26,738 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:26,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:26,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1757289300, now seen corresponding path program 1 times [2023-02-17 02:49:26,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:26,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030973389] [2023-02-17 02:49:26,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:26,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:26,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:26,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:26,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030973389] [2023-02-17 02:49:26,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030973389] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:26,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:26,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 02:49:26,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433788958] [2023-02-17 02:49:26,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:26,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 02:49:26,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:26,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 02:49:26,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:49:26,896 INFO L87 Difference]: Start difference. First operand 377 states and 531 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:27,096 INFO L93 Difference]: Finished difference Result 536 states and 710 transitions. [2023-02-17 02:49:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:49:27,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-17 02:49:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:27,099 INFO L225 Difference]: With dead ends: 536 [2023-02-17 02:49:27,099 INFO L226 Difference]: Without dead ends: 536 [2023-02-17 02:49:27,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:49:27,099 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 226 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:27,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 864 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:49:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-02-17 02:49:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 393. [2023-02-17 02:49:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 310 states have (on average 1.6806451612903226) internal successors, (521), 376 states have internal predecessors, (521), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 551 transitions. [2023-02-17 02:49:27,106 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 551 transitions. Word has length 21 [2023-02-17 02:49:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:27,106 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 551 transitions. [2023-02-17 02:49:27,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:27,106 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 551 transitions. [2023-02-17 02:49:27,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 02:49:27,107 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:27,107 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] [2023-02-17 02:49:27,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-17 02:49:27,107 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:27,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1569007313, now seen corresponding path program 1 times [2023-02-17 02:49:27,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:27,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141586282] [2023-02-17 02:49:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:27,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:27,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:27,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141586282] [2023-02-17 02:49:27,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141586282] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:27,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:27,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:49:27,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409070984] [2023-02-17 02:49:27,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:27,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:27,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:27,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:27,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:27,180 INFO L87 Difference]: Start difference. First operand 393 states and 551 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:27,264 INFO L93 Difference]: Finished difference Result 634 states and 876 transitions. [2023-02-17 02:49:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:49:27,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-02-17 02:49:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:27,267 INFO L225 Difference]: With dead ends: 634 [2023-02-17 02:49:27,267 INFO L226 Difference]: Without dead ends: 634 [2023-02-17 02:49:27,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:49:27,267 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 239 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:27,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1053 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2023-02-17 02:49:27,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 395. [2023-02-17 02:49:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 312 states have (on average 1.6762820512820513) internal successors, (523), 378 states have internal predecessors, (523), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 553 transitions. [2023-02-17 02:49:27,277 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 553 transitions. Word has length 22 [2023-02-17 02:49:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:27,278 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 553 transitions. [2023-02-17 02:49:27,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:27,278 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 553 transitions. [2023-02-17 02:49:27,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 02:49:27,279 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:27,279 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] [2023-02-17 02:49:27,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-17 02:49:27,279 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash 206000049, now seen corresponding path program 1 times [2023-02-17 02:49:27,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:27,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132484847] [2023-02-17 02:49:27,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:27,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:27,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:27,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132484847] [2023-02-17 02:49:27,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132484847] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:27,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:27,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:49:27,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210928059] [2023-02-17 02:49:27,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:27,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:27,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:27,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:27,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:27,345 INFO L87 Difference]: Start difference. First operand 395 states and 553 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:27,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:27,406 INFO L93 Difference]: Finished difference Result 630 states and 868 transitions. [2023-02-17 02:49:27,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:49:27,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-02-17 02:49:27,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:27,408 INFO L225 Difference]: With dead ends: 630 [2023-02-17 02:49:27,408 INFO L226 Difference]: Without dead ends: 630 [2023-02-17 02:49:27,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:49:27,409 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 236 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:27,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1117 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:49:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2023-02-17 02:49:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 393. [2023-02-17 02:49:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 310 states have (on average 1.667741935483871) internal successors, (517), 376 states have internal predecessors, (517), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 547 transitions. [2023-02-17 02:49:27,417 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 547 transitions. Word has length 22 [2023-02-17 02:49:27,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:27,417 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 547 transitions. [2023-02-17 02:49:27,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 547 transitions. [2023-02-17 02:49:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 02:49:27,419 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:27,419 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] [2023-02-17 02:49:27,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-17 02:49:27,419 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:27,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:27,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2074565938, now seen corresponding path program 1 times [2023-02-17 02:49:27,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:27,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684452457] [2023-02-17 02:49:27,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:27,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:27,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:27,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:27,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684452457] [2023-02-17 02:49:27,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684452457] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:27,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:27,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 02:49:27,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368634997] [2023-02-17 02:49:27,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:27,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 02:49:27,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:27,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 02:49:27,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:49:27,548 INFO L87 Difference]: Start difference. First operand 393 states and 547 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:27,781 INFO L93 Difference]: Finished difference Result 566 states and 761 transitions. [2023-02-17 02:49:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 02:49:27,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-02-17 02:49:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:27,782 INFO L225 Difference]: With dead ends: 566 [2023-02-17 02:49:27,783 INFO L226 Difference]: Without dead ends: 566 [2023-02-17 02:49:27,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-17 02:49:27,783 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 185 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:27,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1164 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:49:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2023-02-17 02:49:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 403. [2023-02-17 02:49:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 320 states have (on average 1.653125) internal successors, (529), 384 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 559 transitions. [2023-02-17 02:49:27,790 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 559 transitions. Word has length 22 [2023-02-17 02:49:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:27,790 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 559 transitions. [2023-02-17 02:49:27,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 559 transitions. [2023-02-17 02:49:27,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 02:49:27,790 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:27,790 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] [2023-02-17 02:49:27,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-17 02:49:27,790 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:27,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:27,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1039595598, now seen corresponding path program 1 times [2023-02-17 02:49:27,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:27,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803984193] [2023-02-17 02:49:27,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:27,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:27,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 02:49:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:27,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:27,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803984193] [2023-02-17 02:49:27,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803984193] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:27,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:27,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 02:49:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742579453] [2023-02-17 02:49:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:27,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:49:27,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:27,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:49:27,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:27,817 INFO L87 Difference]: Start difference. First operand 403 states and 559 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:27,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:27,974 INFO L93 Difference]: Finished difference Result 638 states and 820 transitions. [2023-02-17 02:49:27,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 02:49:27,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-02-17 02:49:27,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:27,976 INFO L225 Difference]: With dead ends: 638 [2023-02-17 02:49:27,976 INFO L226 Difference]: Without dead ends: 638 [2023-02-17 02:49:27,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:27,977 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 291 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:27,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 424 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2023-02-17 02:49:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 423. [2023-02-17 02:49:27,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 340 states have (on average 1.673529411764706) internal successors, (569), 404 states have internal predecessors, (569), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 599 transitions. [2023-02-17 02:49:27,984 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 599 transitions. Word has length 23 [2023-02-17 02:49:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:27,984 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 599 transitions. [2023-02-17 02:49:27,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 599 transitions. [2023-02-17 02:49:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 02:49:27,984 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:27,984 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] [2023-02-17 02:49:27,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-17 02:49:27,984 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1039595597, now seen corresponding path program 1 times [2023-02-17 02:49:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:27,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934777691] [2023-02-17 02:49:27,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:28,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 02:49:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:28,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:28,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934777691] [2023-02-17 02:49:28,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934777691] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:28,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:28,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:49:28,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023157854] [2023-02-17 02:49:28,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:28,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:28,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:28,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:28,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:28,064 INFO L87 Difference]: Start difference. First operand 423 states and 599 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:28,279 INFO L93 Difference]: Finished difference Result 475 states and 624 transitions. [2023-02-17 02:49:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:49:28,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-02-17 02:49:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:28,281 INFO L225 Difference]: With dead ends: 475 [2023-02-17 02:49:28,281 INFO L226 Difference]: Without dead ends: 475 [2023-02-17 02:49:28,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:49:28,282 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 340 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:28,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 493 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:49:28,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2023-02-17 02:49:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 423. [2023-02-17 02:49:28,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 340 states have (on average 1.6470588235294117) internal successors, (560), 404 states have internal predecessors, (560), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:28,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 590 transitions. [2023-02-17 02:49:28,294 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 590 transitions. Word has length 23 [2023-02-17 02:49:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:28,294 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 590 transitions. [2023-02-17 02:49:28,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 590 transitions. [2023-02-17 02:49:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 02:49:28,295 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:28,295 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] [2023-02-17 02:49:28,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-17 02:49:28,295 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:28,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:28,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1218800521, now seen corresponding path program 1 times [2023-02-17 02:49:28,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:28,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076417972] [2023-02-17 02:49:28,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:28,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:28,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:28,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:28,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076417972] [2023-02-17 02:49:28,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076417972] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:28,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:28,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:49:28,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950948885] [2023-02-17 02:49:28,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:28,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:49:28,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:28,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:49:28,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:28,319 INFO L87 Difference]: Start difference. First operand 423 states and 590 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:28,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:28,330 INFO L93 Difference]: Finished difference Result 435 states and 602 transitions. [2023-02-17 02:49:28,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:49:28,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-02-17 02:49:28,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:28,332 INFO L225 Difference]: With dead ends: 435 [2023-02-17 02:49:28,332 INFO L226 Difference]: Without dead ends: 435 [2023-02-17 02:49:28,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:28,333 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 3 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:28,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 523 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:49:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2023-02-17 02:49:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 432. [2023-02-17 02:49:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 349 states have (on average 1.6303724928366763) internal successors, (569), 413 states have internal predecessors, (569), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 599 transitions. [2023-02-17 02:49:28,340 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 599 transitions. Word has length 25 [2023-02-17 02:49:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:28,341 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 599 transitions. [2023-02-17 02:49:28,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 599 transitions. [2023-02-17 02:49:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 02:49:28,341 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:28,341 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] [2023-02-17 02:49:28,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-17 02:49:28,341 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:28,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:28,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1220647563, now seen corresponding path program 1 times [2023-02-17 02:49:28,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:28,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67185911] [2023-02-17 02:49:28,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:28,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:28,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:28,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67185911] [2023-02-17 02:49:28,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67185911] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:28,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:28,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 02:49:28,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856134227] [2023-02-17 02:49:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:28,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:49:28,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:28,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:49:28,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:28,394 INFO L87 Difference]: Start difference. First operand 432 states and 599 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:28,529 INFO L93 Difference]: Finished difference Result 732 states and 965 transitions. [2023-02-17 02:49:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 02:49:28,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-02-17 02:49:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:28,533 INFO L225 Difference]: With dead ends: 732 [2023-02-17 02:49:28,534 INFO L226 Difference]: Without dead ends: 732 [2023-02-17 02:49:28,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:28,534 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 317 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:28,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 435 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2023-02-17 02:49:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 491. [2023-02-17 02:49:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 409 states have (on average 1.6039119804400979) internal successors, (656), 472 states have internal predecessors, (656), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 686 transitions. [2023-02-17 02:49:28,544 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 686 transitions. Word has length 25 [2023-02-17 02:49:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:28,544 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 686 transitions. [2023-02-17 02:49:28,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 686 transitions. [2023-02-17 02:49:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 02:49:28,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:28,544 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] [2023-02-17 02:49:28,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-17 02:49:28,545 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:28,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1220647562, now seen corresponding path program 1 times [2023-02-17 02:49:28,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:28,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649209779] [2023-02-17 02:49:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:28,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:28,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:28,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:28,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649209779] [2023-02-17 02:49:28,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649209779] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:28,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:28,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:49:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254410779] [2023-02-17 02:49:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:28,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:49:28,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:28,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:49:28,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:49:28,565 INFO L87 Difference]: Start difference. First operand 491 states and 686 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:28,633 INFO L93 Difference]: Finished difference Result 574 states and 771 transitions. [2023-02-17 02:49:28,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:49:28,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-02-17 02:49:28,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:28,635 INFO L225 Difference]: With dead ends: 574 [2023-02-17 02:49:28,635 INFO L226 Difference]: Without dead ends: 574 [2023-02-17 02:49:28,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:49:28,635 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 142 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:28,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 254 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2023-02-17 02:49:28,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 488. [2023-02-17 02:49:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 409 states have (on average 1.5745721271393642) internal successors, (644), 469 states have internal predecessors, (644), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 674 transitions. [2023-02-17 02:49:28,642 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 674 transitions. Word has length 25 [2023-02-17 02:49:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:28,642 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 674 transitions. [2023-02-17 02:49:28,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 674 transitions. [2023-02-17 02:49:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 02:49:28,643 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:28,643 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, 1] [2023-02-17 02:49:28,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-17 02:49:28,643 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:28,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:28,643 INFO L85 PathProgramCache]: Analyzing trace with hash 416881146, now seen corresponding path program 1 times [2023-02-17 02:49:28,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:28,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719612867] [2023-02-17 02:49:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:28,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:28,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 02:49:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:28,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:28,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719612867] [2023-02-17 02:49:28,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719612867] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:28,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:28,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:49:28,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089285063] [2023-02-17 02:49:28,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:28,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 02:49:28,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:28,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 02:49:28,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:49:28,699 INFO L87 Difference]: Start difference. First operand 488 states and 674 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:28,947 INFO L93 Difference]: Finished difference Result 1147 states and 1574 transitions. [2023-02-17 02:49:28,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 02:49:28,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-02-17 02:49:28,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:28,950 INFO L225 Difference]: With dead ends: 1147 [2023-02-17 02:49:28,950 INFO L226 Difference]: Without dead ends: 1147 [2023-02-17 02:49:28,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-02-17 02:49:28,951 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 488 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:28,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1505 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:49:28,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2023-02-17 02:49:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 583. [2023-02-17 02:49:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 504 states have (on average 1.5873015873015872) internal successors, (800), 559 states have internal predecessors, (800), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 18 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 830 transitions. [2023-02-17 02:49:28,961 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 830 transitions. Word has length 26 [2023-02-17 02:49:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:28,961 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 830 transitions. [2023-02-17 02:49:28,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 830 transitions. [2023-02-17 02:49:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 02:49:28,961 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:28,961 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, 1] [2023-02-17 02:49:28,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-17 02:49:28,961 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:28,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:28,962 INFO L85 PathProgramCache]: Analyzing trace with hash -93653031, now seen corresponding path program 1 times [2023-02-17 02:49:28,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:28,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326224292] [2023-02-17 02:49:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:28,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 02:49:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:29,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:29,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326224292] [2023-02-17 02:49:29,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326224292] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:29,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:29,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:49:29,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592835667] [2023-02-17 02:49:29,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:29,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 02:49:29,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:29,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 02:49:29,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:49:29,012 INFO L87 Difference]: Start difference. First operand 583 states and 830 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:29,272 INFO L93 Difference]: Finished difference Result 1144 states and 1564 transitions. [2023-02-17 02:49:29,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 02:49:29,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-02-17 02:49:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:29,276 INFO L225 Difference]: With dead ends: 1144 [2023-02-17 02:49:29,276 INFO L226 Difference]: Without dead ends: 1144 [2023-02-17 02:49:29,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-02-17 02:49:29,276 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 521 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:29,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1571 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:49:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2023-02-17 02:49:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 485. [2023-02-17 02:49:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 409 states have (on average 1.550122249388753) internal successors, (634), 466 states have internal predecessors, (634), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 664 transitions. [2023-02-17 02:49:29,286 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 664 transitions. Word has length 26 [2023-02-17 02:49:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:29,286 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 664 transitions. [2023-02-17 02:49:29,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 664 transitions. [2023-02-17 02:49:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 02:49:29,286 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:29,286 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, 1] [2023-02-17 02:49:29,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-17 02:49:29,287 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:29,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:29,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2088228101, now seen corresponding path program 1 times [2023-02-17 02:49:29,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:29,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347460447] [2023-02-17 02:49:29,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:29,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:29,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:29,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:29,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:29,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347460447] [2023-02-17 02:49:29,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347460447] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:29,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:29,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 02:49:29,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49310625] [2023-02-17 02:49:29,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:29,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:49:29,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:29,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:49:29,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:29,343 INFO L87 Difference]: Start difference. First operand 485 states and 664 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:29,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:29,482 INFO L93 Difference]: Finished difference Result 778 states and 1018 transitions. [2023-02-17 02:49:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 02:49:29,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-02-17 02:49:29,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:29,484 INFO L225 Difference]: With dead ends: 778 [2023-02-17 02:49:29,484 INFO L226 Difference]: Without dead ends: 778 [2023-02-17 02:49:29,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:29,485 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 304 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:29,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 492 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2023-02-17 02:49:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 485. [2023-02-17 02:49:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 409 states have (on average 1.550122249388753) internal successors, (634), 466 states have internal predecessors, (634), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 664 transitions. [2023-02-17 02:49:29,492 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 664 transitions. Word has length 26 [2023-02-17 02:49:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:29,492 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 664 transitions. [2023-02-17 02:49:29,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 664 transitions. [2023-02-17 02:49:29,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 02:49:29,492 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:29,492 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, 1] [2023-02-17 02:49:29,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-17 02:49:29,493 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:29,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1505674617, now seen corresponding path program 1 times [2023-02-17 02:49:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:29,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002829877] [2023-02-17 02:49:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:29,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:29,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:29,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002829877] [2023-02-17 02:49:29,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002829877] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:29,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:29,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:49:29,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710581793] [2023-02-17 02:49:29,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:29,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:29,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:29,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:29,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:29,547 INFO L87 Difference]: Start difference. First operand 485 states and 664 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:29,600 INFO L93 Difference]: Finished difference Result 678 states and 907 transitions. [2023-02-17 02:49:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:49:29,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-02-17 02:49:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:29,602 INFO L225 Difference]: With dead ends: 678 [2023-02-17 02:49:29,602 INFO L226 Difference]: Without dead ends: 678 [2023-02-17 02:49:29,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:49:29,603 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 224 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:29,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1343 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:49:29,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2023-02-17 02:49:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 424. [2023-02-17 02:49:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 349 states have (on average 1.5472779369627507) internal successors, (540), 405 states have internal predecessors, (540), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 570 transitions. [2023-02-17 02:49:29,611 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 570 transitions. Word has length 26 [2023-02-17 02:49:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:29,611 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 570 transitions. [2023-02-17 02:49:29,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:29,611 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 570 transitions. [2023-02-17 02:49:29,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 02:49:29,612 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:29,613 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, 1, 1] [2023-02-17 02:49:29,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-17 02:49:29,613 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:29,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:29,613 INFO L85 PathProgramCache]: Analyzing trace with hash 38390969, now seen corresponding path program 1 times [2023-02-17 02:49:29,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:29,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665818708] [2023-02-17 02:49:29,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:29,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:29,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 02:49:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:29,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665818708] [2023-02-17 02:49:29,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665818708] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:29,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:29,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:49:29,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770798425] [2023-02-17 02:49:29,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:29,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:49:29,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:29,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:49:29,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:29,676 INFO L87 Difference]: Start difference. First operand 424 states and 570 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:29,782 INFO L93 Difference]: Finished difference Result 492 states and 630 transitions. [2023-02-17 02:49:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:49:29,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-02-17 02:49:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:29,784 INFO L225 Difference]: With dead ends: 492 [2023-02-17 02:49:29,784 INFO L226 Difference]: Without dead ends: 492 [2023-02-17 02:49:29,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:49:29,785 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 153 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:29,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 599 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2023-02-17 02:49:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 424. [2023-02-17 02:49:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 349 states have (on average 1.5444126074498568) internal successors, (539), 405 states have internal predecessors, (539), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 569 transitions. [2023-02-17 02:49:29,790 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 569 transitions. Word has length 27 [2023-02-17 02:49:29,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:29,790 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 569 transitions. [2023-02-17 02:49:29,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 569 transitions. [2023-02-17 02:49:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 02:49:29,791 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:29,791 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, 1, 1] [2023-02-17 02:49:29,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-17 02:49:29,791 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:29,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:29,791 INFO L85 PathProgramCache]: Analyzing trace with hash 516237483, now seen corresponding path program 1 times [2023-02-17 02:49:29,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:29,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834224979] [2023-02-17 02:49:29,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:29,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:29,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:29,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:29,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834224979] [2023-02-17 02:49:29,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834224979] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:29,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:29,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 02:49:29,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646122133] [2023-02-17 02:49:29,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:29,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 02:49:29,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:29,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 02:49:29,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:49:29,843 INFO L87 Difference]: Start difference. First operand 424 states and 569 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:29,943 INFO L93 Difference]: Finished difference Result 615 states and 812 transitions. [2023-02-17 02:49:29,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:49:29,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-02-17 02:49:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:29,944 INFO L225 Difference]: With dead ends: 615 [2023-02-17 02:49:29,944 INFO L226 Difference]: Without dead ends: 615 [2023-02-17 02:49:29,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:49:29,945 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 153 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:29,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1000 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:29,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2023-02-17 02:49:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 454. [2023-02-17 02:49:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 379 states have (on average 1.5145118733509235) internal successors, (574), 435 states have internal predecessors, (574), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 604 transitions. [2023-02-17 02:49:29,951 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 604 transitions. Word has length 27 [2023-02-17 02:49:29,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:29,951 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 604 transitions. [2023-02-17 02:49:29,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 604 transitions. [2023-02-17 02:49:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 02:49:29,951 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:29,952 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, 1, 1] [2023-02-17 02:49:29,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-17 02:49:29,952 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash 516237677, now seen corresponding path program 1 times [2023-02-17 02:49:29,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:29,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294300778] [2023-02-17 02:49:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:29,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:29,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:29,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:29,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294300778] [2023-02-17 02:49:29,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294300778] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:29,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:29,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 02:49:29,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868800954] [2023-02-17 02:49:29,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:29,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:49:29,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:29,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:49:29,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:29,991 INFO L87 Difference]: Start difference. First operand 454 states and 604 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:30,107 INFO L93 Difference]: Finished difference Result 776 states and 987 transitions. [2023-02-17 02:49:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 02:49:30,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-02-17 02:49:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:30,109 INFO L225 Difference]: With dead ends: 776 [2023-02-17 02:49:30,109 INFO L226 Difference]: Without dead ends: 776 [2023-02-17 02:49:30,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:30,110 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 443 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:30,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 371 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:30,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-02-17 02:49:30,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 544. [2023-02-17 02:49:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 469 states have (on average 1.4968017057569296) internal successors, (702), 525 states have internal predecessors, (702), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 732 transitions. [2023-02-17 02:49:30,117 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 732 transitions. Word has length 27 [2023-02-17 02:49:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:30,117 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 732 transitions. [2023-02-17 02:49:30,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 732 transitions. [2023-02-17 02:49:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-17 02:49:30,117 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:30,117 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, 1, 1, 1] [2023-02-17 02:49:30,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-17 02:49:30,117 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:30,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1190828282, now seen corresponding path program 1 times [2023-02-17 02:49:30,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:30,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41457080] [2023-02-17 02:49:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:30,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:30,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 02:49:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:30,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:30,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41457080] [2023-02-17 02:49:30,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41457080] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:30,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:30,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-17 02:49:30,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287872071] [2023-02-17 02:49:30,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:30,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 02:49:30,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:30,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 02:49:30,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:49:30,274 INFO L87 Difference]: Start difference. First operand 544 states and 732 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:30,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:30,665 INFO L93 Difference]: Finished difference Result 648 states and 831 transitions. [2023-02-17 02:49:30,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 02:49:30,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2023-02-17 02:49:30,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:30,667 INFO L225 Difference]: With dead ends: 648 [2023-02-17 02:49:30,667 INFO L226 Difference]: Without dead ends: 648 [2023-02-17 02:49:30,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2023-02-17 02:49:30,668 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 271 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:30,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1428 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:49:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2023-02-17 02:49:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 427. [2023-02-17 02:49:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 360 states have (on average 1.4833333333333334) internal successors, (534), 414 states have internal predecessors, (534), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-17 02:49:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 552 transitions. [2023-02-17 02:49:30,674 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 552 transitions. Word has length 28 [2023-02-17 02:49:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:30,674 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 552 transitions. [2023-02-17 02:49:30,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 552 transitions. [2023-02-17 02:49:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-17 02:49:30,675 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:30,675 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, 1, 1, 1] [2023-02-17 02:49:30,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-17 02:49:30,675 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:30,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1037479271, now seen corresponding path program 1 times [2023-02-17 02:49:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:30,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863657576] [2023-02-17 02:49:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:30,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:30,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:30,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:30,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863657576] [2023-02-17 02:49:30,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863657576] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:30,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:30,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 02:49:30,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634806671] [2023-02-17 02:49:30,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:30,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:49:30,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:30,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:49:30,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:30,734 INFO L87 Difference]: Start difference. First operand 427 states and 552 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:30,853 INFO L93 Difference]: Finished difference Result 619 states and 784 transitions. [2023-02-17 02:49:30,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 02:49:30,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2023-02-17 02:49:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:30,855 INFO L225 Difference]: With dead ends: 619 [2023-02-17 02:49:30,855 INFO L226 Difference]: Without dead ends: 619 [2023-02-17 02:49:30,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:30,856 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 298 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:30,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 374 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:30,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2023-02-17 02:49:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 340. [2023-02-17 02:49:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 274 states have (on average 1.4817518248175183) internal successors, (406), 327 states have internal predecessors, (406), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-17 02:49:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 424 transitions. [2023-02-17 02:49:30,861 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 424 transitions. Word has length 28 [2023-02-17 02:49:30,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:30,862 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 424 transitions. [2023-02-17 02:49:30,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 424 transitions. [2023-02-17 02:49:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 02:49:30,862 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:30,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:30,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-02-17 02:49:30,863 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:30,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash -734692199, now seen corresponding path program 1 times [2023-02-17 02:49:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:30,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392683523] [2023-02-17 02:49:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:30,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:30,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:30,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:30,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392683523] [2023-02-17 02:49:30,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392683523] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:30,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:30,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:49:30,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492124957] [2023-02-17 02:49:30,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:30,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:30,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:30,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:30,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:30,907 INFO L87 Difference]: Start difference. First operand 340 states and 424 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:31,021 INFO L93 Difference]: Finished difference Result 422 states and 516 transitions. [2023-02-17 02:49:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:49:31,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-02-17 02:49:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:31,022 INFO L225 Difference]: With dead ends: 422 [2023-02-17 02:49:31,023 INFO L226 Difference]: Without dead ends: 422 [2023-02-17 02:49:31,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:49:31,023 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 444 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:31,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 496 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-02-17 02:49:31,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 339. [2023-02-17 02:49:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 274 states have (on average 1.4744525547445255) internal successors, (404), 326 states have internal predecessors, (404), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-17 02:49:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 422 transitions. [2023-02-17 02:49:31,031 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 422 transitions. Word has length 35 [2023-02-17 02:49:31,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:31,031 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 422 transitions. [2023-02-17 02:49:31,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:31,031 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 422 transitions. [2023-02-17 02:49:31,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 02:49:31,031 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:31,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:31,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-02-17 02:49:31,032 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:31,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash -734692198, now seen corresponding path program 1 times [2023-02-17 02:49:31,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:31,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412844073] [2023-02-17 02:49:31,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:31,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:31,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:31,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:31,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:31,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412844073] [2023-02-17 02:49:31,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412844073] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:31,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:31,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:49:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622176662] [2023-02-17 02:49:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:31,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:31,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:31,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:31,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:31,117 INFO L87 Difference]: Start difference. First operand 339 states and 422 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:31,203 INFO L93 Difference]: Finished difference Result 338 states and 420 transitions. [2023-02-17 02:49:31,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:49:31,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-02-17 02:49:31,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:31,204 INFO L225 Difference]: With dead ends: 338 [2023-02-17 02:49:31,204 INFO L226 Difference]: Without dead ends: 338 [2023-02-17 02:49:31,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:49:31,205 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 472 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:31,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 304 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-02-17 02:49:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2023-02-17 02:49:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 274 states have (on average 1.467153284671533) internal successors, (402), 325 states have internal predecessors, (402), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-17 02:49:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 420 transitions. [2023-02-17 02:49:31,217 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 420 transitions. Word has length 35 [2023-02-17 02:49:31,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:31,217 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 420 transitions. [2023-02-17 02:49:31,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 420 transitions. [2023-02-17 02:49:31,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 02:49:31,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:31,218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:31,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-02-17 02:49:31,218 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:31,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1664563334, now seen corresponding path program 1 times [2023-02-17 02:49:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:31,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459362195] [2023-02-17 02:49:31,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:31,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:31,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:31,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:31,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459362195] [2023-02-17 02:49:31,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459362195] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:31,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:31,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:49:31,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365751183] [2023-02-17 02:49:31,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:31,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:49:31,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:31,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:49:31,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:31,256 INFO L87 Difference]: Start difference. First operand 338 states and 420 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:31,389 INFO L93 Difference]: Finished difference Result 697 states and 845 transitions. [2023-02-17 02:49:31,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:49:31,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2023-02-17 02:49:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:31,391 INFO L225 Difference]: With dead ends: 697 [2023-02-17 02:49:31,391 INFO L226 Difference]: Without dead ends: 697 [2023-02-17 02:49:31,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:31,392 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 464 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:31,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 429 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2023-02-17 02:49:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 335. [2023-02-17 02:49:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 274 states have (on average 1.4452554744525548) internal successors, (396), 322 states have internal predecessors, (396), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-17 02:49:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 414 transitions. [2023-02-17 02:49:31,412 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 414 transitions. Word has length 37 [2023-02-17 02:49:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:31,412 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 414 transitions. [2023-02-17 02:49:31,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 414 transitions. [2023-02-17 02:49:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 02:49:31,412 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:31,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:31,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-02-17 02:49:31,412 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:31,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1664563333, now seen corresponding path program 1 times [2023-02-17 02:49:31,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:31,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284001413] [2023-02-17 02:49:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:31,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:31,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:31,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:31,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284001413] [2023-02-17 02:49:31,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284001413] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:31,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:31,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:49:31,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975635919] [2023-02-17 02:49:31,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:31,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:31,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:31,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:31,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:31,506 INFO L87 Difference]: Start difference. First operand 335 states and 414 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:31,665 INFO L93 Difference]: Finished difference Result 529 states and 653 transitions. [2023-02-17 02:49:31,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:49:31,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2023-02-17 02:49:31,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:31,667 INFO L225 Difference]: With dead ends: 529 [2023-02-17 02:49:31,667 INFO L226 Difference]: Without dead ends: 529 [2023-02-17 02:49:31,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:49:31,667 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 705 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:31,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 395 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:31,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-02-17 02:49:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 334. [2023-02-17 02:49:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 274 states have (on average 1.437956204379562) internal successors, (394), 321 states have internal predecessors, (394), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-17 02:49:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 412 transitions. [2023-02-17 02:49:31,671 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 412 transitions. Word has length 37 [2023-02-17 02:49:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:31,672 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 412 transitions. [2023-02-17 02:49:31,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 412 transitions. [2023-02-17 02:49:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 02:49:31,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:31,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:31,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-02-17 02:49:31,672 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:31,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:31,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1664563172, now seen corresponding path program 1 times [2023-02-17 02:49:31,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:31,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679840055] [2023-02-17 02:49:31,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:31,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:31,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:31,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:31,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679840055] [2023-02-17 02:49:31,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679840055] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:31,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:31,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:49:31,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502082829] [2023-02-17 02:49:31,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:31,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:49:31,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:31,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:49:31,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:31,773 INFO L87 Difference]: Start difference. First operand 334 states and 412 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:31,993 INFO L93 Difference]: Finished difference Result 473 states and 538 transitions. [2023-02-17 02:49:31,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:49:31,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2023-02-17 02:49:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:31,995 INFO L225 Difference]: With dead ends: 473 [2023-02-17 02:49:31,995 INFO L226 Difference]: Without dead ends: 473 [2023-02-17 02:49:31,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:31,995 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 345 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:31,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 409 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:49:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-02-17 02:49:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 334. [2023-02-17 02:49:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 274 states have (on average 1.4306569343065694) internal successors, (392), 321 states have internal predecessors, (392), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-17 02:49:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 410 transitions. [2023-02-17 02:49:31,999 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 410 transitions. Word has length 37 [2023-02-17 02:49:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:32,000 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 410 transitions. [2023-02-17 02:49:32,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 410 transitions. [2023-02-17 02:49:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 02:49:32,000 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:32,000 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:32,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-02-17 02:49:32,000 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:32,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1071259938, now seen corresponding path program 1 times [2023-02-17 02:49:32,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:32,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251744264] [2023-02-17 02:49:32,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:32,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:32,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:32,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251744264] [2023-02-17 02:49:32,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251744264] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:32,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:32,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-17 02:49:32,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655511666] [2023-02-17 02:49:32,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:32,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 02:49:32,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:32,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 02:49:32,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-17 02:49:32,204 INFO L87 Difference]: Start difference. First operand 334 states and 410 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:32,537 INFO L93 Difference]: Finished difference Result 641 states and 790 transitions. [2023-02-17 02:49:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 02:49:32,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-17 02:49:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:32,539 INFO L225 Difference]: With dead ends: 641 [2023-02-17 02:49:32,539 INFO L226 Difference]: Without dead ends: 641 [2023-02-17 02:49:32,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-02-17 02:49:32,540 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 638 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:32,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 820 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:49:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2023-02-17 02:49:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 335. [2023-02-17 02:49:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 276 states have (on average 1.4275362318840579) internal successors, (394), 322 states have internal predecessors, (394), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-17 02:49:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 412 transitions. [2023-02-17 02:49:32,544 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 412 transitions. Word has length 48 [2023-02-17 02:49:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:32,544 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 412 transitions. [2023-02-17 02:49:32,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 412 transitions. [2023-02-17 02:49:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 02:49:32,545 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:32,545 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:32,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-02-17 02:49:32,545 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:32,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:32,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1071260000, now seen corresponding path program 1 times [2023-02-17 02:49:32,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:32,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659875690] [2023-02-17 02:49:32,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:32,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:32,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:32,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:32,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659875690] [2023-02-17 02:49:32,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659875690] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:32,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:32,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:49:32,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018833947] [2023-02-17 02:49:32,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:32,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:32,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:32,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:32,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:32,651 INFO L87 Difference]: Start difference. First operand 335 states and 412 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:32,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:32,768 INFO L93 Difference]: Finished difference Result 350 states and 425 transitions. [2023-02-17 02:49:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:49:32,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-17 02:49:32,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:32,769 INFO L225 Difference]: With dead ends: 350 [2023-02-17 02:49:32,769 INFO L226 Difference]: Without dead ends: 350 [2023-02-17 02:49:32,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:49:32,769 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 257 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:32,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 302 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:32,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-02-17 02:49:32,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 332. [2023-02-17 02:49:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 274 states have (on average 1.4197080291970803) internal successors, (389), 319 states have internal predecessors, (389), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-17 02:49:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 407 transitions. [2023-02-17 02:49:32,773 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 407 transitions. Word has length 48 [2023-02-17 02:49:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:32,773 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 407 transitions. [2023-02-17 02:49:32,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 407 transitions. [2023-02-17 02:49:32,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-17 02:49:32,774 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:32,774 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, 1, 1, 1, 1] [2023-02-17 02:49:32,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-02-17 02:49:32,774 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:32,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:32,774 INFO L85 PathProgramCache]: Analyzing trace with hash 122043664, now seen corresponding path program 1 times [2023-02-17 02:49:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:32,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3064443] [2023-02-17 02:49:32,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:32,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:32,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-02-17 02:49:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 02:49:32,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:32,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3064443] [2023-02-17 02:49:32,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3064443] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:32,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:32,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:49:32,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996688918] [2023-02-17 02:49:32,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:32,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:32,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:32,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:32,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:32,885 INFO L87 Difference]: Start difference. First operand 332 states and 407 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 02:49:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:33,004 INFO L93 Difference]: Finished difference Result 385 states and 480 transitions. [2023-02-17 02:49:33,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 02:49:33,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2023-02-17 02:49:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:33,006 INFO L225 Difference]: With dead ends: 385 [2023-02-17 02:49:33,006 INFO L226 Difference]: Without dead ends: 385 [2023-02-17 02:49:33,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:49:33,006 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 435 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:33,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 298 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-02-17 02:49:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 330. [2023-02-17 02:49:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 274 states have (on average 1.405109489051095) internal successors, (385), 317 states have internal predecessors, (385), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-17 02:49:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 403 transitions. [2023-02-17 02:49:33,011 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 403 transitions. Word has length 50 [2023-02-17 02:49:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:33,011 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 403 transitions. [2023-02-17 02:49:33,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 02:49:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 403 transitions. [2023-02-17 02:49:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-17 02:49:33,012 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:33,012 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:33,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-02-17 02:49:33,012 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:33,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:33,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1996957779, now seen corresponding path program 1 times [2023-02-17 02:49:33,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:33,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949701841] [2023-02-17 02:49:33,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:33,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:33,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:33,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:33,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949701841] [2023-02-17 02:49:33,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949701841] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:33,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:33,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-17 02:49:33,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841840787] [2023-02-17 02:49:33,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:33,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 02:49:33,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:33,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 02:49:33,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-02-17 02:49:33,351 INFO L87 Difference]: Start difference. First operand 330 states and 403 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:34,278 INFO L93 Difference]: Finished difference Result 1073 states and 1311 transitions. [2023-02-17 02:49:34,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 02:49:34,279 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2023-02-17 02:49:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:34,281 INFO L225 Difference]: With dead ends: 1073 [2023-02-17 02:49:34,281 INFO L226 Difference]: Without dead ends: 1073 [2023-02-17 02:49:34,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=250, Invalid=872, Unknown=0, NotChecked=0, Total=1122 [2023-02-17 02:49:34,282 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 1293 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:34,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 1863 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 02:49:34,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2023-02-17 02:49:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 476. [2023-02-17 02:49:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 413 states have (on average 1.3922518159806296) internal successors, (575), 459 states have internal predecessors, (575), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 605 transitions. [2023-02-17 02:49:34,291 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 605 transitions. Word has length 51 [2023-02-17 02:49:34,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:34,291 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 605 transitions. [2023-02-17 02:49:34,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:34,291 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 605 transitions. [2023-02-17 02:49:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-17 02:49:34,293 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:34,293 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:34,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-02-17 02:49:34,294 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:34,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:34,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1996957778, now seen corresponding path program 1 times [2023-02-17 02:49:34,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:34,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776315531] [2023-02-17 02:49:34,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:34,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:34,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:34,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776315531] [2023-02-17 02:49:34,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776315531] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:34,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:34,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-17 02:49:34,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931607289] [2023-02-17 02:49:34,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:34,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 02:49:34,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:34,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 02:49:34,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-17 02:49:34,737 INFO L87 Difference]: Start difference. First operand 476 states and 605 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:35,147 INFO L93 Difference]: Finished difference Result 506 states and 636 transitions. [2023-02-17 02:49:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 02:49:35,148 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2023-02-17 02:49:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:35,153 INFO L225 Difference]: With dead ends: 506 [2023-02-17 02:49:35,153 INFO L226 Difference]: Without dead ends: 506 [2023-02-17 02:49:35,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2023-02-17 02:49:35,153 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 139 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:35,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 952 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:49:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2023-02-17 02:49:35,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 496. [2023-02-17 02:49:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 433 states have (on average 1.3764434180138567) internal successors, (596), 479 states have internal predecessors, (596), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 626 transitions. [2023-02-17 02:49:35,159 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 626 transitions. Word has length 51 [2023-02-17 02:49:35,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:35,159 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 626 transitions. [2023-02-17 02:49:35,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 626 transitions. [2023-02-17 02:49:35,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-17 02:49:35,161 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:35,161 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:35,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-02-17 02:49:35,162 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:35,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1999969648, now seen corresponding path program 1 times [2023-02-17 02:49:35,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:35,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106535634] [2023-02-17 02:49:35,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:35,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:35,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:35,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:35,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106535634] [2023-02-17 02:49:35,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106535634] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:49:35,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644259367] [2023-02-17 02:49:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:35,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:49:35,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:49:35,492 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:49:35,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 02:49:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:35,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 55 conjunts are in the unsatisfiable core [2023-02-17 02:49:35,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:35,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:35,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 02:49:35,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-17 02:49:35,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-17 02:49:35,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:49:35,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 02:49:35,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:49:35,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 02:49:35,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-17 02:49:35,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-17 02:49:35,885 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 7 [2023-02-17 02:49:35,887 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 7 [2023-02-17 02:49:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:35,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:35,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644259367] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:35,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:49:35,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 23 [2023-02-17 02:49:35,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979817494] [2023-02-17 02:49:35,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:35,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 02:49:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:35,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 02:49:35,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2023-02-17 02:49:35,911 INFO L87 Difference]: Start difference. First operand 496 states and 626 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:36,593 INFO L93 Difference]: Finished difference Result 890 states and 1038 transitions. [2023-02-17 02:49:36,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 02:49:36,594 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2023-02-17 02:49:36,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:36,596 INFO L225 Difference]: With dead ends: 890 [2023-02-17 02:49:36,596 INFO L226 Difference]: Without dead ends: 890 [2023-02-17 02:49:36,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2023-02-17 02:49:36,597 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 691 mSDsluCounter, 1953 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:36,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 2193 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 02:49:36,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2023-02-17 02:49:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 501. [2023-02-17 02:49:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 438 states have (on average 1.36986301369863) internal successors, (600), 484 states have internal predecessors, (600), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 02:49:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 630 transitions. [2023-02-17 02:49:36,604 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 630 transitions. Word has length 52 [2023-02-17 02:49:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:36,604 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 630 transitions. [2023-02-17 02:49:36,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 630 transitions. [2023-02-17 02:49:36,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-17 02:49:36,604 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:36,604 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:36,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 02:49:36,810 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,SelfDestructingSolverStorable42 [2023-02-17 02:49:36,810 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-17 02:49:36,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:36,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1818456665, now seen corresponding path program 1 times [2023-02-17 02:49:36,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:36,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333349905] [2023-02-17 02:49:36,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:36,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:37,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 02:49:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:37,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:37,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333349905] [2023-02-17 02:49:37,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333349905] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:49:37,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703331574] [2023-02-17 02:49:37,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:37,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:49:37,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:49:37,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:49:37,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 02:49:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:37,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-17 02:49:37,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:37,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:37,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2023-02-17 02:49:37,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 02:49:37,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 02:49:37,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 02:49:37,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 02:49:37,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 02:49:37,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 02:49:37,544 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:37,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2023-02-17 02:49:37,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:37,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2023-02-17 02:49:37,939 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:49:37,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:37,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 460 treesize of output 640 [2023-02-17 02:49:37,970 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:49:37,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:37,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 328 treesize of output 592